<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:
    part = []
    parts = []

    def partitions(self, s : str, n : int, p : List[List[int]]) :
        if n == len(s) :
            if len(self.part) != 0 :
                self.parts.append(self.part[:])
                return
        
        for i in range(n, len(s)) :
            if (s[i] == s[n]) and (((n + 2) >= i) or (p[n + 1][i - 1] == 1)) :
                p[n][i] = 1
                self.part.append(s[n : i + 1])
                self.partitions(s, i + 1, p)
                del self.part[-1]

    def partition(self, s: str) -> List[List[str]]:
        self.part = []
        self.parts = []
        self.partitions(s, 0, [[0 for i in range(len(s))] for i in range(len(s))])

        return copy.deepcopy(self.parts)
38590