<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:
vector<string> ans;
int dp[31][31];
    vector<string> findAllConcatenatedWordsInADict(vector<string>& words) {
       map<string,int> mp;
       for(auto it:words){
        mp[it]++;
       }
       for(int i=0;i<words.size();i++){
        if(!words[i].empty()){
            memset(dp,-1,sizeof(dp));
            if(recurse(words[i],0,0,mp)){
                ans.push_back(words[i]);
            }
        }
       }
       return ans;
    }
    bool recurse(string &word,int start,int count,map<string,int>& mp){
        if(start==word.size()){
           return count>=2;
        }
        if(dp[start][count]!=-1){
            return dp[start][count];
        }
        string curr="";
        for(int j=start;j<word.size();j++){
            curr+=word[j];
            if(mp[curr]>0 && curr!=word){
                if(recurse(word,j+1,count+1,mp)){
                    return dp[start][count]=true;
                }
            }
        }
        return dp[start][count]=false;
    }
};
103963