<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 palindrome(string s,int f,int l)
    {
        while(f<=l)
        {
            if(s[f]!=s[l]) 
            {
                return false; 
            }
            f++;
            l--;
        }
        return true;
    }
    void f(int ind,vector <vector <string>> &ans, vector <string> ds, string s)
    {
        if(s.size()==ind)
        {
            ans.push_back(ds);
            return;
        }
        for(int i=ind;i<=s.size();i++)
        {
            if(palindrome(s,ind,i))
            {
                ds.push_back(s.substr(ind,i-ind+1));
                f(i+1,ans,ds,s);
                ds.pop_back();
            }
        }
    }
    vector<vector<string>> partition(string s) {
        vector<vector <string>> ans;
        vector <string> ds;
        f(0,ans,ds,s);
        return ans;
    }
};
152066