<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 {
vector<string>temp;
vector<vector<string>>ans;
private:

bool isPalindrome(string s){
    string t=s;
    reverse(s.begin(),s.end());
    if(t==s) return true;
    return false;
}
void helper (string s){
    if(s==""){
        ans.push_back(temp);
        return;
    }

    //my work
    string t="";
    for(int i=0;i<s.size();i++){
        t=s.substr(0,i+1);
        if(isPalindrome(t)){
            temp.push_back(t);
            helper(s.substr(i+1));
            temp.pop_back();
        }
    }
}
    
public:
    vector<vector<string>> partition(string s) {
        helper(s);
        return ans;      
    }
};
81969