<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]]:
        def isPal(arr):
            j = len(arr) - 1
            for i in range(len(arr) // 2):
                if arr[i] != arr[j]:
                    return False
                j -= 1
            return True
        
        out = []

        def getpartition(arr, res):
            if not arr:
                out.append(res)
                return

            for i in range(len(arr)):
                string = arr[:i+1]
                if isPal(string):
                    tmp = res.copy()
                    tmp.append(string)
                    getpartition(arr[i + 1:], tmp)
        
        getpartition(s, [])
        return out



37368