<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 check(vector<string>v){
        for(int i=0; i<v.size(); i++){
            string temp = v[i];
            string revtemp = temp;
            reverse(temp.begin(), temp.end());
            if(temp != revtemp){return false;}
        }    
        cout<<"yes"<<endl;

        return true;        
    }

    void solve(string s, int start, vector<string>v){
        int n = s.size();
        if(start==n){
            if(check(v)){ans.push_back(v);}
            return;
        }

        for(int i=start+1; i<=n; i++){
            string temp = s.substr(start, i - start);
            v.push_back(temp);
            solve(s,i,v);
            v.pop_back();
        }
    }

    vector<vector<string>> partition(string s) {
        //vector<vector<string>> ans;
        vector<string>v;
        solve(s,0,v);

        return ans;
    }
};
199860