<p>You are given an array of strings <code>products</code> and a string <code>searchWord</code>.</p>

<p>Design a system that suggests at most three product names from <code>products</code> after each character of <code>searchWord</code> is typed. Suggested products should have common prefix with <code>searchWord</code>. If there are more than three products with a common prefix return the three lexicographically minimums products.</p>

<p>Return <em>a list of lists of the suggested products after each character of </em><code>searchWord</code><em> is typed</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> products = [&quot;mobile&quot;,&quot;mouse&quot;,&quot;moneypot&quot;,&quot;monitor&quot;,&quot;mousepad&quot;], searchWord = &quot;mouse&quot;
<strong>Output:</strong> [[&quot;mobile&quot;,&quot;moneypot&quot;,&quot;monitor&quot;],[&quot;mobile&quot;,&quot;moneypot&quot;,&quot;monitor&quot;],[&quot;mouse&quot;,&quot;mousepad&quot;],[&quot;mouse&quot;,&quot;mousepad&quot;],[&quot;mouse&quot;,&quot;mousepad&quot;]]
<strong>Explanation:</strong> products sorted lexicographically = [&quot;mobile&quot;,&quot;moneypot&quot;,&quot;monitor&quot;,&quot;mouse&quot;,&quot;mousepad&quot;].
After typing m and mo all products match and we show user [&quot;mobile&quot;,&quot;moneypot&quot;,&quot;monitor&quot;].
After typing mou, mous and mouse the system suggests [&quot;mouse&quot;,&quot;mousepad&quot;].
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> products = [&quot;havana&quot;], searchWord = &quot;havana&quot;
<strong>Output:</strong> [[&quot;havana&quot;],[&quot;havana&quot;],[&quot;havana&quot;],[&quot;havana&quot;],[&quot;havana&quot;],[&quot;havana&quot;]]
<strong>Explanation:</strong> The only word &quot;havana&quot; will be always suggested while typing the search word.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= products.length &lt;= 1000</code></li>
	<li><code>1 &lt;= products[i].length &lt;= 3000</code></li>
	<li><code>1 &lt;= sum(products[i].length) &lt;= 2 * 10<sup>4</sup></code></li>
	<li>All the strings of <code>products</code> are <strong>unique</strong>.</li>
	<li><code>products[i]</code> consists of lowercase English letters.</li>
	<li><code>1 &lt;= searchWord.length &lt;= 1000</code></li>
	<li><code>searchWord</code> consists of lowercase English letters.</li>
</ul>

class TrieNode {
public:
    TrieNode* links[26];
    bool isEnd;
    TrieNode() {
        memset(links, 0, sizeof(links));
        isEnd = false;
    }
};

class Trie {
public:
    TrieNode* root;
    Trie() { root = new TrieNode(); }

    void insert(string& word) {
        TrieNode* node = root;
        for (char ch : word) {
            if (!node->links[ch - 'a']) {
                node->links[ch - 'a'] = new TrieNode();
            }
            node = node->links[ch - 'a'];
        }
        node->isEnd = true;
    }

    vector<string> search(string& word) {
        TrieNode* node = root;
        vector<string> prod;
        for (char ch : word) {
            if (node->links[ch - 'a'])
                node = node->links[ch - 'a'];
            else
                return prod;
        }
        dfs(node, word, prod);
        return prod;
    }
    void dfs(TrieNode* node, string& s, vector<string>& prod) {
        if (prod.size() == 3)
            return;
        if (node->isEnd) {
            prod.push_back(s);
        }
        for (char i = 'a'; i <= 'z'; i++) {
            if (prod.size() == 3)
                return;
            if (node->links[i - 'a']) {
                s.push_back(i);
                dfs(node->links[i - 'a'], s, prod);
                s.pop_back();
            }
        }
    }
};
class Solution {
public:
    vector<vector<string>> suggestedProducts(vector<string>& products,
                                             string search) {
        Trie trie = Trie();
        for (string& word : products) {
            trie.insert(word);
        }
        vector<vector<string>> ans;
        string pre = "";
        for (char& ch : search) {
            pre += ch;
            ans.push_back(trie.search(pre));
        }
        return ans;
    }
};
77370