<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 isPalindrome(const std::string& s) {
    // Create a reversed copy of the string
    std::string reversed = s;
    std::reverse(reversed.begin(), reversed.end());

    // Compare the original string with the reversed string
    return s == reversed;
    }
    void fn(string s, vector<string> v)
    {
        if(s.size()==0)
        {
            ans.push_back(v);
            return ;
        }
        // if(isPalindrome(s)==true)
        // {
        //     v.push_back(s);
        //     ans.push_back(v);

        //     if(v.size()>1)
        //     {
        //     return;
        //     }
            
        // }
        for(int i=0;i<s.size();i++)
        {
            string substring = s.substr(0, i + 1);
            vector<string> x=v;
            if(isPalindrome(substring))
            {
                x.push_back(substring);
                fn(s.substr(i+1),x);
            }  
        }
        return ;
        
    }
    vector<vector<string>> partition(string s) {
        vector<string> x;
        fn(s,x);
        return ans;
    }
};
244468