<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 check(self, split):
        # for i in range(len(split)//2):
        #     if split[i] != split[-i-1]:
        #         return False
        
        return split == split[::-1]

    def solve(self, i, s, sub, res):
        if i == len(s):
            if sub:
                res.append(sub.copy())
            
            return
        
        split = ""
        for j in range(i, len(s)):
            split += s[j]
            if self.check(split):
                sub.append(split)
                self.solve(j+1, s, sub, res)
                sub.pop()

    def partition(self, s: str) -> List[List[str]]:
        res = []
        
        self.solve(0, s, [], res)

        return res
24531