<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 {
    void ans(string &s,int i,string str,vector<vector<string>> & res,vector<string> v)
 {
     string st=str;
     reverse(st.begin(),st.end());
     if(i==s.size())
     {
         if(str==st)
         {
         v.push_back(str);
         res.push_back(v);
         }
     return;
     }
     str+=s[i];
     ans(s,i+1,str,res,v);
     str.pop_back();
     if(str==st)
     {
         v.push_back(str);
         str=s[i];
         ans(s,i+1,str,res,v);
     }
     return;
 }
public:
    vector<vector<string>> partition(string s) {
        vector<vector<string>> res;
        vector<string> v;
        string str="";
        str+=s[0];
        ans(s,1,str,res,v);
        reverse(res.begin(),res.end());
        return res;
    }
};
244468