<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 {
private:
    vector<vector<string>> v;
public:
    vector<vector<string>> partition(string s) {
        vector<string> t;
        pr(0, s, t);
        return v;
    }

    void pr(int ind, string s, vector<string>& t) {
        if(ind==s.size()) {
            // cout << "add" << endl;
            v.push_back(t);
            return;
        }
        // cout << ind << ", " << t.size() << endl;
        for(int i=1; ind+i<=s.size(); i++) {
            string temp = s.substr(ind, i);
            // cout << temp;
            if(ip(temp)) {
                // cout << "\tpal" << endl;
                t.push_back(temp);
                pr(ind+i, s, t);
                t.pop_back();
            }
            // cout << endl;
        }
    }

    bool ip(string s) {
        int i=0, j=s.size()-1;
        while(i<j) {
            if(s[i++]!=s[j--])
                return false;
        }
        return true;
    } 
};
85155