<p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string"><strong>palindrome</strong></span>. Return <em>all possible palindrome partitioning of </em><code>s</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> s = "aab"
<strong>Output:</strong> [["a","a","b"],["aa","b"]]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> s = "a"
<strong>Output:</strong> [["a"]]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 16</code></li>
	<li><code>s</code> contains only lowercase English letters.</li>
</ul>

class Solution:
    def dp(self,i,s,st):
        if i>=len(s):
            self.lst.append(tuple(st))
            return 
        for j in range(i,len(s)):
            if s[i:j+1]==''.join(reversed(s[i:j+1])):
                st.append(s[i:j+1])
                x=self.dp(j+1,s,st)
                st.pop()
        return
    def partition(self, s: str) -> List[List[str]]:
        self.lst=[]
        self.dp(0,s,[])
        return self.lst
25550