<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 Node{
    public:
        char ch;
        unordered_map <char, Node*> mp;
        vector <string> words;
        bool terminal;

    public:
        Node(char ch, string word, bool terminal=false){
            this->ch = ch;
            this->terminal = terminal;
            this->words = {word}; 
        }

        void addWord(string word){
            this->words.push_back(word);
            sort(this->words.begin(), this->words.end());
        }
};

class Trie{
    private:
        Node* root;

    public:
        Trie(Node* node){
            this->root = node; 
        }

        void insert(string word){
            Node* node = root;
            for(char ch : word){
                if(node->mp.find(ch) == node->mp.end()){
                    Node* nn = new Node(ch, word);
                    node->mp[ch] = nn;
                    node = nn;
                }
                else{
                    node = node->mp[ch];
                    node->addWord(word);
                }
            }
            node->terminal = true;
        }

        bool search(string word){
            Node* node = root;
            for(char ch : word){
                if(!node)
                    return false;

                if(node->mp.find(ch) == node->mp.end()){
                    return false;
                }
                else{
                    node = node->mp[ch];
                }
            }

            return node->terminal;
        }

        vector<vector<string>> findMatches(string x){
            Node* node = this->root;
            vector<vector<string>> result;

            for(char ch : x){
                vector <string> curr;
                // if(node->mp.find(ch) == node->mp.end())

                if(node)
                    node = node->mp[ch];
                if(!node){
                    result.push_back(curr);
                    continue;
                }

                int n = node->words.size();
                int mn = min(3, n);
                for(int k=0;k<mn;k++){
                    curr.push_back(node->words[k]);
                }
                result.push_back(curr);
            }

            return result;
        }
};

class Solution {
public:
    vector<vector<string>> suggestedProducts(vector<string>& products, string searchWord) {
        vector<vector<string>> result;
        sort(products.begin(), products.end());
        Node* root = new Node('&', "");
        Trie trie = Trie(root);

        for(string product : products){
            trie.insert(product);
        }

        return trie.findMatches(searchWord);
    }
};
178510