<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:
bool check(string s){
    int n=s.size();
    for(int i=0;i<n/2;i++){
        if(s[i]!=s[n-1-i]){
            return false;
        }
    }
    return true;
}
void solve(vector<vector<string>>&v,int i,vector<string>s,string str,string arr){
   int n=arr.size();
//    cout<<str<<" "<<endl;
if(i==n){
    if(check(str)){
    if(str!="")s.push_back(str);
    v.push_back(s);
    }
    return;
}
vector<string>x;
x=s;
if(check(str) && str!=""){
    x.push_back(str);
    string a="";
    a=a+arr[i];
    solve(v,i+1,x,a,arr);
}
solve(v,i+1,s,str+arr[i],arr);
 
  
// string a=a+s[i];



}
    vector<vector<string>> partition(string s) {
      vector<vector<string>>v;
      string a="";
      a+=s[0];
    //   string b=b+s[0];
    //   cout<<b<<" ";
      solve(v,1,{},a,s);
      


      return v;
    }
};
305006