<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 isPalindrom(string s) {
        if(s == "") return false;

        string rev = s;
        reverse(rev.begin(), rev.end());

        if(s == rev) return true;
        else return false;
    }

    void getPartitions(
        string &s,
        int n,
        string currentString,
        vector<string>& currentPalindromes,
        vector<vector<string>>& palindromes) {

            if(n < 0) {
                if(isPalindrom(currentString)) {
                    currentPalindromes.push_back(currentString);
                    palindromes.push_back(currentPalindromes);
                    currentPalindromes.pop_back();
                }
                return;
            }

            if(isPalindrom(currentString)) {
                currentPalindromes.push_back(currentString);
                string tempString = currentString;
                currentString = s[n];
                getPartitions(s, n - 1, currentString, currentPalindromes, palindromes);

                currentString = tempString;
                currentPalindromes.pop_back();
            }

            currentString = currentString + s[n];
            getPartitions(s, n - 1, currentString, currentPalindromes, palindromes);
        }

    vector<vector<string>> partition(string s) {

        vector<string> currentPalindromes;
        vector<vector<string>> palindroms;

        reverse(s.begin(), s.end());
        string currentString = "";

        getPartitions(s, s.size() - 1, currentString, currentPalindromes, palindroms);
        return palindroms;    
    }
};
72410