<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 Trie{
    public:
    vector<Trie*> children = vector<Trie*>(26, nullptr);
    bool flag = 0;
};

class Solution {
public:
    vector<string> findAllConcatenatedWordsInADict(vector<string>& words) {
        vector<string> res;
        Trie* root = new Trie();
        for(auto& el: words)
        {
            Trie* ptr=root;
            for(int i=0; i<el.size(); i++)
            {
                if(ptr->children[el[i]-'a']==nullptr)
                {
                    Trie* t = new Trie();
                    ptr->children[el[i]-'a']=t;
                    ptr=t;
                }
                else
                {
                    ptr=ptr->children[el[i]-'a'];
                }
            }
            ptr->flag=1;
        }

        for(auto& el: words)
        {
            // cout <<endl;
            vector<Trie*> dfs={root};
            vector<int> id={0};
            int p=0;
            while(!dfs.empty())
            {
                if(p==32) break;
                p++;
                int cnt=id[id.size()-1];
                // cout << el.size()<<": "<<cnt<<endl;
                
                if(cnt==el.size())
                {
                    // cout <<"ok";
                    if((dfs[dfs.size()-1]==root) && dfs.size()>2)
                    {
                        res.push_back(el);
                        break;
                    }
                    dfs.pop_back();
                    id.pop_back();
                    continue;
                }
                if(dfs[dfs.size()-1]->children[el[id[id.size()-1]]-'a']!=nullptr)
                {
                    dfs[dfs.size()-1]=dfs[dfs.size()-1]->children[el[cnt]-'a'];
                    id[id.size()-1]++;
                    if(dfs[dfs.size()-1]->flag==1)
                    {
                        dfs.push_back(root);
                        id.push_back(id[id.size()-1]);
                    }
                }
                else
                {
                    dfs.pop_back();
                    id.pop_back();
                }
            }
            // if(p==31)
            // {
            //     cout << el.size() <<": "<<id[id.size()-1]<<endl;
            // }
            // cout << endl;
        }
        return res;
    }
};
276801