<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:
    class TrieNode{
        public:
        unordered_map<char ,TrieNode*> mp;
        bool end;
        TrieNode (){
            end=false;
        }
    };

    class Trie{
        public:
        TrieNode * trie;
        int cnt;
        Trie(){
            trie=new TrieNode();
            cnt=0;
        }
        void insert(string s){
            TrieNode *trieNode=trie;
            for(int i=0;i<(int)s.size();i++){
                if(trieNode->mp.find(s[i])==trieNode->mp.end()){
                    trieNode->mp[s[i]]=new TrieNode();
                    cnt++;
                   // cout<<s[i]<<" ";
                }
                trieNode=trieNode->mp[s[i]];
            }
            //cout<<s[(int)s.size()-1]<<endl;
            trieNode->end=true;
        }
    };

    vector<string> findAllConcatenatedWordsInADict(vector<string>& words) {
        Trie* trie= new Trie();
       for(int i=0;i<(int)words.size();i++){
        trie->insert(words[i]);
       }
       //cout<<trie->cnt<<endl;
        vector<int>dp;
       function<int (int ,int ,string )> helper=[&](int i,int c,string s){
           if(i>=(int)s.size())return c>=2?1:0;
           if(dp[i]!=-1)return dp[i];
           TrieNode *tempTrie=trie->trie;
           for(int j=i;j<(int)s.size();j++){
                //cout<<j<<" "<<s[j]<<" ";
                if(tempTrie->mp.find(s[j])==tempTrie->mp.end()){
                    return dp[i]=0;
                }
                tempTrie=tempTrie->mp[s[j]];
                if(tempTrie->end==true){
                   //cout<<s[j]<<" came here "<<endl;
                    dp[i]=helper(j+1,c+1,s)?1:0;
                    if(dp[i])return dp[i];
                }
           }
          // cout<<endl;
           return dp[i]=0;
       };
       vector<string>res;
       for(int i=0;i<(int)words.size();i++){
        dp=vector<int>(words[i].size(),-1);
        if(helper(0,0,words[i]))res.push_back(words[i]);
       }
       return res;
    }
};
217093