<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:
    bool palindrome(int start,int end,string s)
    {
        string temp=s;
        while(start<end)
        {
            swap(s[start],s[end]);
            start++;
            end--;
        }
        return (s==temp);
    }
    private:
    void solve(int ind,string s,vector<vector<string>> &ans,vector<string> output)
    {
        if(ind==s.size())
        {
                ans.push_back(output);
                return;

        }
        for(int i=ind;i<s.size();i++)
        {
             if(palindrome(ind,i,s))
            {
                    output.push_back(s.substr(ind,i-ind+1));
                    solve(i+1,s,ans,output);
                    output.pop_back();
            }
        }
    }
public:
    vector<vector<string>> partition(string s) {
        vector<string> output;
        vector<vector<string>> ans;
        solve(0,s,ans,output);
        return ans;
        
    }
};
155253