<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 solve(self, s, index, ds, res):
        if index == len(s):
            res.add(tuple(ds))
            return
        for i in range(index, len(s)):
            if s[index:i+1] == s[index:i+1][::-1]:
                ds.append(s[index:i+1])
                self.solve(s, i + 1, ds, res)
                ds.pop()
    def partition(self, s: str) -> List[List[str]]:
        ds = []
        res = set()
        self.solve(s, 0, ds, res)
        return list(map(lambda x: list(x), res))
36553