<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:
    bool isPal(string s) {
        int l = 0, r = s.size()-1;
        while(l<r) {
            if(s[l++] != s[r--]) return 0;
        }
        return 1;
    }
    bool isAllPal(vector<string> &temp) {
        for(string str:temp) {
            if(!isPal(str)) return 0;
        }
        return 1;
    }
    bool isAllPresent(vector<string> &temp, string s) {
        int i = 0;
        for(string str:temp) {
            for(char c:str) {
                if(c != s[i]) {
                    break;
                }
                i++;
            }
        }
        return i == s.size();
    }
    void solve(string s, int prev, int curr, vector<string> &temp, vector<vector<string>> &ans) {
        if(curr >= s.size()) {
            if(isAllPal(temp) && isAllPresent(temp, s))
            {
                ans.push_back(temp);
                return;
            }
            return;
        }

        temp.push_back(s.substr(prev, curr - prev + 1));
        solve(s, curr+1, curr+1, temp, ans);
        temp.pop_back();
        solve(s, prev, curr+1, temp, ans);
    }
    vector<vector<string>> partition(string s) {
        vector<string> temp;
        vector<vector<string>> ans;
        solve(s, 0, 0, temp, ans);
        return ans;
    }
};
158439