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

from typing import List


class Solution:
    def partition(self, s: str) -> List[List[str]]:
        ans = []
        n = len(s)

        def isPalindrome(t: str) -> bool:
            m = len(t)
            if m <= 1:
                return True
            for i in range(m // 2):
                if t[i] != t[m - 1 - i]:
                    return False
            return True

        def helper(ind: int, text: str, curr: List[str]):
            print(curr)
            if ind == n:  # base condition
                for item in curr:
                    if not isPalindrome(item):
                        return
                ans.append(curr)
                return

            for i in range(ind + 1, n + 1):
                temp = curr.copy()
                temp.append(text[ind:i])
                helper(i, text, temp)

        helper(0, s, [])
        return ans

37571