<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 Solution {
    class TrieNode{
        public:
        map<char, TrieNode*> children;
        bool end;
        TrieNode(){
            end = false;
        }
    };
    TrieNode* root;
public:
    void addProducts(vector<string>& products){
        for(int i=0; i<products.size(); i++){
            TrieNode* iter = root;
            for(int j=0; j<products[i].length(); j++){
                if(iter->children[products[i][j]] == NULL){
                    iter->children[products[i][j]] = new TrieNode();
                }
                iter = iter->children[products[i][j]];
            }
            iter->end = true;
        }
    }

    void getThree(TrieNode* iter, int& count, vector<string>& ans, string t){
        if(!iter || count >=3)
            return;
        if(iter->end){
            ans.push_back(t);
            count++;
        }
        for(auto i: iter->children){
            if(i.second){
                getThree(i.second,count, ans, t+i.first);
            }
        }
    }

    vector<vector<string>> suggestedProducts(vector<string>& products, string searchWord) {
        root = new TrieNode();
        addProducts(products);
        vector<vector<string>> ans;
        TrieNode* iter = root;
        string w = "";
        for(int i=0; i<searchWord.length(); i++){
            vector<string> temp; 
            if(!iter){
                ans.push_back(temp);
                continue;
            }
            iter = iter->children[searchWord[i]];
            w += searchWord[i];
            int ct = 0;
            getThree(iter, ct, temp, w);
            ans.push_back(temp);
        }
        return ans;
    }
};
536390