<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 {
public:
    vector<vector<string>>ans;
    bool ispalin(string str){
        string strrev=str;
        reverse(str.begin(),str.end());
        return str==strrev;
    }
    void allPalindromes(string& s,vector<string>&res,int idx){
        if(idx==s.size()){
            ans.push_back(res);
            return;
        }
        string palin="";
        for(int i=idx;i<s.size();i++){
            palin+=s[i];
            if(ispalin(palin)){
                res.push_back(palin);
                allPalindromes(s,res,i+1);
                res.pop_back();
            }
        }
    }
    vector<vector<string>> partition(string s) {
       vector<string>res;
       int n=s.length();
       allPalindromes(s,res,0);
       return ans; 
    }
};
81969