<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<int>> pal;
    vector<vector<string>> ans;

    void palcheck(int i,int j,int n,string& s){
        while(i>=0 && j<n && s[i]==s[j]){
            pal[i][j]=1;
            i--;
            j++;
        }
    }

    void solve(int ind,vector<string> temp,int n,string& s){
        if(ind==n){
            ans.push_back(temp);
            return;
        }

        for(int i=ind;i<n;i++){
            if(pal[ind][i]==1){
                temp.push_back(s.substr(ind,i-ind+1));
                solve(i+1,temp,n,s);
                temp.pop_back();
            }
        }

    }

    vector<vector<string>> partition(string s) {
        //store start and end of all pal strings
        pal.assign(16,vector<int> (16,0));
        int n=s.length();
        for(int i=0;i<n;i++){
            palcheck(i,i,n,s);
            palcheck(i,i+1,n,s);
        }

        vector<string> temp;

        solve(0,temp,n,s);

        return ans;

    }
};
167998