<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 check(string s,int first , int last)
    {
        if(first >=last)
        {
            return true;
        }
        return ( (check(s,first+1,last-1)) && (s[last] == s[first]));
    }
    void helper(string s,vector<string>temp,int idx)
    {
        if(idx == s.length())
        {
            ans.push_back(temp);
            return;
        }
        for(int i=idx;i<s.length();i++)
        {
            if(check(s,idx,i))
            {
                temp.push_back(s.substr(idx,i-idx+1));
                helper(s,temp,i+1);
                temp.pop_back();

            }
        }
    }
    vector<vector<string>> partition(string s)
    {
        vector<string>op;
        helper(s,op,0);
        return ans;
    }
};
180743