<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 {
    bool check(string s){
        if(s.empty())return true;
        if(s.size()==1)return true;
        if(s[0]==s[s.size()-1]){
            return check(s.substr(1,s.size()-2));
        }
        return false;
    }
    void solve(string s, vector<string> path, vector<vector<string>>& result) {
        if(s.empty()){
            result.push_back(path);
            return;
        }
        if(s.size()==1){
            path.push_back(s.substr(0,1));
            result.push_back(path);
            return;
        }
        for(int l=1;l<=s.size();l++){
            if(check(s.substr(0,l))){
                path.push_back(s.substr(0,l));
                solve(s.substr(l,s.size()-l),path,result);
                path.pop_back();
            }
        }
    }

    
public:
    vector<vector<string>> partition(string s) {
        vector<vector<string>> result;
        vector<string> path;
        solve(s, path, result);
        return result;
    }
};
129763