<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>> ans;

    bool palindrome(int i, int j, string& str) {
        while(i < j) {
            if(str[i] != str[j]) return false;
            i++, j--;
        }
        return true;
    }

    void generateStrings(vector<int>& temp, string& s) {
        vector<string> strs;
        int prev = 0;
        for(int i : temp) {
            string substr = s.substr(prev, i - prev);
            if(palindrome(0, substr.size() - 1, substr)) {
                strs.push_back(substr);
                prev = i;
            } else {
                return;
            }
        }
        ans.push_back(strs);
    }

    void solver(string& s, int idx, vector<int>& temp) {
        if(idx == s.size()) {
            generateStrings(temp, s);
            return;
        }

        for(int i = idx; i < s.size(); i++) {
            temp.push_back(i + 1);
            solver(s, i + 1, temp);
            temp.pop_back();
        }
    }

    vector<vector<string>> partition(string s) {
        vector<int> temp;
        solver(s, 0, temp);
        return ans;
    }
};

148880