<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>> partition(string &s) {
        int n = s.size();
        vector<vector<string>> ans;

        for(int i = 0; i < (1<<n); i++){
            if(i & (1<<(n-1))){
                bool check = 1;
                vector<string> vec;

                string str = "";
                for(int j = 0; j < n; j++){
                    str += s[j];

                    if((1<<j) & i){
                        string temp = str;
                        reverse(temp.begin(), temp.end());

                        if(str == temp){
                            vec.push_back(str);
                            str.clear();
                        }
                        else{
                            check = 0;
                            vec.clear();
                            break;
                        }
                    }
                }

                if(check == 1){
                    // cout<<i<<" ";
                    ans.push_back(vec);
                }
            }
        }

        return ans;
    }
};
120204