<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 isPalindrome(string s, int i, int j)
    {
        while(i <= j)
        {
            if(s[i] == s[j])
            {
                i++;
                j--;
            }
            else
                return false;
        }
        return true;
    }

    string toSubString(string s, int i, int j)
    {
        string str = "";
        for(int k = i; k <= j; k++)
        {
            str += s[k];
        }
        return str;
    }

    void solve(string s, vector<vector<string>> &ans, vector<string> &temp,int index, int len)
    {
        if(index == len)
        {
            ans.push_back(temp);
            return;
        }
        for(int i = index; i<len; i++)
        {
            if(isPalindrome(s, index, i))
            {
                temp.push_back(toSubString(s, index, i));
                solve(s, ans, temp, i+1, len);
                temp.pop_back();
            }
        }
    }

    vector<vector<string>> partition(string s) {
        vector<vector<string>> ans;
        vector<string> temp;
        int len = s.length();
        solve(s, ans, temp, 0, len);
        return ans;
    }
};
66038