<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 TrieNode {
public:
    vector<TrieNode*> children;
    int path = 0;
    int end = 0;

    TrieNode(){
        children.assign(26,nullptr);
    }
};

class Solution {
public:
    vector<string> findAllConcatenatedWordsInADict(vector<string>& words) {
        auto root = new TrieNode();

        for(auto w : words){
            auto node = root;
            for(auto c : w){
                c -= 'a';
                if (node->children[c]==nullptr){
                    node->children[c] = new TrieNode();
                }
                node = node->children[c];
                node->path++;
            }
            node->end++;
        }

        auto check = [&](auto&& check, string s)->bool{
            int n = s.size();

            vector<int> dp(n);

            for(int i=0; i<n; ++i){
                if (i==0 || dp[i-1]){
                    auto node = root;

                    for(int j=i; j<n; ++j){
                        int c = s[j]-'a';
                        if (node->children[c]==nullptr){
                            break;
                        }

                        node = node->children[c];
                        if (node->end>0 && !(i==0 && j==n-1)){
                            dp[j] = 1;
                        }
                    }
                }
            }

            return dp[n-1];
        };

        vector<string> ans;
        for(auto w : words){
            if (check(check, w)){
                ans.push_back(w);
            }
        }

        return ans;
    }

    // vector<string> fun2(vector<string>& words) {

    // }

    vector<string> fun1(vector<string>& words) {
        unordered_set<string> dictionary(words.begin(), words.end());
        vector<string> answer;
        for (const string& word : words) {
            const int length = word.length();
            vector<bool> dp(length + 1);
            dp[0] = true;
            for (int i = 1; i <= length; ++i) {
                for (int j = (i == length ? 1 : 0); !dp[i] && j < i; ++j) {
                    dp[i] = dp[j] && dictionary.count(word.substr(j, i - j));
                }
            }
            if (dp[length]) {
                answer.push_back(word);
            }
        }
        return answer;
    }
};

267373