<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 check(string s){
        if(s.size()==0)return false;
        stack<char> st;
        for(auto ch:s)st.push(ch);
        int i=0;
        while(!st.empty() && i<s.size()){
            if(st.top()!=s[i])return false;
            st.pop();
            i++;
        }
        if(st.empty() && i==s.size())return true;
        return false;
    }

    void func(vector<vector<string>> &ans, string s, vector<string> temp, int i){
        if(i>=s.size()){
            ans.push_back(temp);
            return;
        }
        for(int j=i;j<s.size();j++){
            if(check(s.substr(i, j-i+1))){
                temp.push_back(s.substr(i, j-i+1));
                func(ans, s, temp, j+1);
                temp.pop_back();
            }
        }
        return;


    }
    
    vector<vector<string>> partition(string s) {
        vector<vector<string>> ans;
        vector<string> temp;
        func(ans, s, temp, 0);
        return ans;
    }
};
254026