<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>> partitions;
    bool is_Palin(string& s,int start,int end)
    {
        while(start<end)
        {
            if(s[start]!=s[end])
            return false;
            start++;
            end--;
        }
        return true;
    }
    void backtrack(string& s,int index,vector<string> partition)
    {
        if(index==s.size())
        {
            partitions.push_back(partition);
            return;
        }
        partition.push_back(string(1,s[index]));
        backtrack(s,index+1,partition);
        partition.pop_back();
        for(int i=index+1;i<s.size();i++)
        {
            if(is_Palin(s,index,i))
            {
                partition.push_back(s.substr(index,i-index+1));
                backtrack(s,i+1,partition);
                partition.pop_back();
            }
        }
    }
    vector<vector<string>> partition(string s) 
    {
        vector<string> p;
        backtrack(s,0,p);
        return partitions;
    }
};
174370