<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:
    struct TrieNode {
        int  chars[31] = {};
        bool contains  = false;
    };

    std::vector<std::string> findAllConcatenatedWordsInADict(std::vector<std::string>& words) {
        std::vector<TrieNode> nodes(1);
        for (auto const& word : words) {
            auto node = nodes.begin();
            std::string_view part = word;
            while (!part.empty()) {
                int idx = node->chars[part.front() - 'a'];
                if (idx > 0)
                    node = nodes.begin() + idx;
                else {
                    node->chars[part.front() - 'a'] = static_cast<int>(nodes.size());
                    nodes.push_back(TrieNode{});
                    node = nodes.end() - 1;
                }
                part.remove_prefix(1);
            }
            node->contains = true;
        }

        std::vector<std::string> ans;
        for (auto & word : words) {
            std::deque<std::pair<std::pair<int, bool>, std::string_view>> queue;
            queue.emplace_back(std::pair<int, bool>{0, false}, word);
            bool look[31] = {};
            while (!queue.empty()) {
                auto [pair, part]    = queue.front();
                auto [idx, compound] = pair;
                queue.pop_front();
                while (!part.empty()) {
                    auto it = nodes[idx].chars[part.front() - 'a'];
                    if (it == 0)
                        break;
                    part.remove_prefix(1);
                    int pos = static_cast<int>(word.size() - part.size());
                    if (nodes[it].contains && !part.empty() && !look[pos]) {
                        queue.emplace_back(std::pair<int, bool>{0, true}, part);
                        look[pos] = true;
                    }
                    idx = it;
                }
                if (part.empty() && nodes[idx].contains && compound) {
                    ans.emplace_back(std::move(word));
                    break;
                }
            }
        }
        return ans;
    }
};
286228