<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>

struct Trie {
    Trie *next[128];
    bool end;
    Trie(){
        for(int i=0;i<128;i++){
            next[i]=NULL;
        }
        end=false;
    }
};

class Solution {
    void DFS(Trie *t, string &curr, set<string> &recs){
        if(recs.count(curr) || recs.size()>=3){
            return;
        }
        if(t->end){
            recs.insert(curr);
        }
        for(int i=0;i<128;i++){
            auto tmp=t;
            if(tmp->next[i]){
                tmp=tmp->next[i];
                curr.push_back(i);
                DFS(tmp,curr,recs);
                curr.pop_back();
            }
        }
    }
public:
    vector<vector<string>> suggestedProducts(vector<string>& products, string searchWord) {
        Trie *t=new Trie();
        for(auto &p:products){
            auto tmp=t;
            for(auto &c:p){
                if(!tmp->next[c]){
                    tmp->next[c]=new Trie();
                }
                tmp=tmp->next[c];
            }
            tmp->end=true;
        }
        vector<vector<string>> ret;
        string word;
        int broken=false;
        for(auto &c:searchWord){
            if(!t->next[c]||broken){
                ret.push_back({});
                broken=true;
                continue;
            }
            word+=c;
            t=t->next[c];
            set<string> recs;
            DFS(t,word,recs);
            vector<string> toadd;
            for(auto &r:recs){
                toadd.push_back(r);
            }
            ret.push_back(toadd);

        }
        return ret;
    }
};
217410