<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]]:
        all_parts = [[s[0]]]
        for c in s[1:]:
            new_parts = []
            for i in all_parts:
                new_parts += [i + [c]]
                new_parts += [i[:-1] + [i[-1] + c]]
            all_parts = new_parts

        valids = []
        for i in all_parts:
            is_valid = True
            for j in i:
                if not self.is_pallindrone(j):
                    is_valid = False
                    break
            if is_valid:
                valids.append(i)
        return valids

    def is_pallindrone(self, s):
        return s == s[::-1]
31663