<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]]:


        dp = [[] for _ in range(len(s) + 1)]
        dp[0] = [[]]

        for i in range(len(s)+1):
            string = s[:i]
            for j in range(i-1, -1, -1):
                currentStr = string[j:]
                if currentStr != currentStr[::-1]:
                    continue
                partitions = dp[j]
                for partition in partitions:
                    partitionCopy = partition[:]
                    partitionCopy.append(currentStr)
                    dp[i].append(partitionCopy)

        return dp[-1]
30848