<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 partition(self, s: str) -> List[List[str]]:
        self.ret = []
        self.partition = []
        def dfs(start, end, currLen):
            if end > len(s):
                if currLen == len(s):
                    self.ret.append(self.partition.copy())
                return
            if s[start: end] == s[start: end][::-1]:
                self.partition.append(s[start: end])
                dfs(end, end + 1, currLen + len(s[start:end]))
                self.partition.pop()
            end = end + 1
            dfs(start, end, currLen)
        dfs(0, 1, 0)
        return self.ret


33089