<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]]:
        if len(s)==0 : return []
        if len(s)==1 : return [s]
        def check_pal(st) :
            if len(st)<=1 : return True
            i = 0
            j = len(st)-1
            while i<j : 
                if st[i]!=st[j] : return False
                i += 1
                j -= 1
            return True
        ans = []
        for i in range(1, len(s)) :
            first = s[:i]
            second =  s[i:]
            if check_pal(first):
                temp = []
                two = self.partition(second)
                temp = [[first, *b] for b in two]
                ans.extend(temp)
        if check_pal(s) : ans.append([s])
        return ans
29829