<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>> result;
    bool isPalin(vector<string> vec){
        for(string s:vec){
            for(int i=0;i<s.size()/2;i++){
                if(s[i]!=s[s.size()-1-i]){
                    return false;
                }
            }
        }
        return true;
    }
    void backtracking(vector<string>temp,string s, int pos){
        if(pos>=s.size()){
            if(isPalin(temp)){
                result.push_back(temp);
            }
            return;
        }
        for(int i=pos;i<s.size();i++){
            string sub=s.substr(pos,i-pos+1);
            temp.push_back(sub);
            backtracking(temp,s,i+1);
            temp.pop_back();
        }
        return;
    }
    vector<vector<string>> partition(string s) {
        vector<string> temp;
        backtracking(temp,s,0);
        return result;
    }
};
199860