<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 pal(string str)
{
    int n=str.length();
    for(int i=0;i<n/2;i++)
    {
        if(str[i]!=str[n-i-1]) 
        {
            return false;
        }
    }
return true;
}

void solve(vector<vector<string>>&ans,string str,int i,vector<string>v)
{   
if(i>=str.length())
{
    ans.push_back(v);
    return;
}
 for(int j=i;j<str.length();j++)
 {
     string ss=str.substr(i,j-i+1);
     v.push_back(ss);
     solve(ans,str,j+1,v);
     v.pop_back();
 }    
}
    vector<vector<string>> partition(string str) {
vector<vector<string>>ans;
vector<vector<string>>vec;
vector<string>v;
solve(ans,str,0,v);
for(auto &it:ans)
{
    int flag=0;
    vector<string>vv=it;
    for(auto &it2:vv)
    {
       if(!pal(it2))
       {
flag=-1;
break;
       }
    }
    if(flag==0)
    {
        vec.push_back(vv);
    }
    
}
return vec;

    }
};
203046