<p>Given an array of strings <code>words</code> (<strong>without duplicates</strong>), return <em>all the <strong>concatenated words</strong> in the given list of</em> <code>words</code>.</p>

<p>A <strong>concatenated word</strong> is defined as a string that is comprised entirely of at least two shorter words (not necessarily distinct)&nbsp;in the given array.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> words = [&quot;cat&quot;,&quot;cats&quot;,&quot;catsdogcats&quot;,&quot;dog&quot;,&quot;dogcatsdog&quot;,&quot;hippopotamuses&quot;,&quot;rat&quot;,&quot;ratcatdogcat&quot;]
<strong>Output:</strong> [&quot;catsdogcats&quot;,&quot;dogcatsdog&quot;,&quot;ratcatdogcat&quot;]
<strong>Explanation:</strong> &quot;catsdogcats&quot; can be concatenated by &quot;cats&quot;, &quot;dog&quot; and &quot;cats&quot;; 
&quot;dogcatsdog&quot; can be concatenated by &quot;dog&quot;, &quot;cats&quot; and &quot;dog&quot;; 
&quot;ratcatdogcat&quot; can be concatenated by &quot;rat&quot;, &quot;cat&quot;, &quot;dog&quot; and &quot;cat&quot;.</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> words = [&quot;cat&quot;,&quot;dog&quot;,&quot;catdog&quot;]
<strong>Output:</strong> [&quot;catdog&quot;]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= words.length &lt;= 10<sup>4</sup></code></li>
	<li><code>1 &lt;= words[i].length &lt;= 30</code></li>
	<li><code>words[i]</code> consists of only lowercase English letters.</li>
	<li>All the strings of <code>words</code> are <strong>unique</strong>.</li>
	<li><code>1 &lt;= sum(words[i].length) &lt;= 10<sup>5</sup></code></li>
</ul>

class Solution {
public:
    unordered_set<string> dict;
    unordered_map<string, bool> m;
    vector<int> dp;
    int n;
    vector<string> findAllConcatenatedWordsInADict(vector<string>& words) {
        n = words.size();
        for(string w: words){
            dict.insert(w);
        }
        vector<string> res;
        for(string w : words) {
            int len = w.length();
            dp.assign(len, -1);
            if(solve(0, w, len)) {
                res.push_back(w);
            }
        }
        return res;
    }

    bool solve(int idx, string& s, int& len) {        
        if(idx == len) {
            return true;
        }
        if(dp[idx] != -1) {
            return dp[idx];
        }
        for(int i=idx; i<len; i++) {
            string prefix = s.substr(idx, i-idx+1);
            if(!dict.count(prefix)) {
                continue;
            }
            string suffix = s.substr(i+1, len-i-1);
            cout << prefix << ',' << suffix << endl;
            if(dict.count(suffix) || (solve(i+1, s, len) && prefix != s)) {
                return true;
            }
        }
        return dp[idx] = false;
    }
};
47398