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

string curr;
vector<string>stt;
int n;
string cur;
bool is_pal(int i, int j){
    bool ok=1;
    while(i<j){
        if(cur[i]==cur[j]){
            i++;
            j--;
        }
        else{
            return 0;
        }
    }
    return 1;
}
vector<vector<string>>ans;
void slv(int indx){
    if(indx==n){
        ans.push_back(stt);
        return;
    }
    for(int i=indx;i<n;i++){
        if(is_pal(indx,i))
        {
            stt.push_back(cur.substr(indx,i-indx+1));
            slv(i+1);
            stt.pop_back();
        }
    }
}
class Solution {
public:
    vector<vector<string>> partition(string s) {
        ans.clear();
        n=s.size();
        cur=s;
        slv(0);
        return ans;
    }
};
75596