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

#define ll long long

struct node {
    node *child[26];
    ll pref;
    multiset<string> strEnd;
    node() {
        pref = 0;
        for(ll i=0; i<26; i++) {
            child[i] = nullptr;
        }
    }
};

struct trie {
    node *root;
    trie() {
        root = new node;
    }
    
    void insert(string &s) {
        node *curr = root;
        for(ll i=0; i<s.length(); i++) {
            char ch = s[i];
            if(curr->child[ch-'a'] == nullptr) {
                curr->child[ch-'a'] = new node;
            }
            curr = curr->child[ch-'a'];
            curr->pref++;
            curr->strEnd.insert(s);
        }
    }
    
    vector<vector<string>> query(string &s) {
        node *curr = root;
        vector<vector<string>> ans;
        for(ll i=0; i<s.length(); i++) {
            char ch = s[i];
            vector<string> temp;
            if(curr->child[ch-'a'] == nullptr) {
                while(i<s.length()) {
                    ans.push_back(temp);
                    i++;
                }
                break;
            }
            curr = curr->child[ch-'a'];
            if(curr->strEnd.size() > 0) {
                auto it = curr->strEnd.begin();
                for(ll i=0; i<3; i++) {
                    if(it != curr->strEnd.end()){
                        temp.push_back(*it);
                        it++;
                    }
                    else {
                        break;
                    }
                }
            }
            ans.push_back(temp);
        }
        return ans;
    }
};

class Solution {
public:
    vector<vector<string>> suggestedProducts(vector<string>& products, string searchWord) {
        trie t;
        ll n = products.size();
        for(ll i=0; i<n; i++) {
            t.insert(products[i]);
        }
        
        return t.query(searchWord);
    }
};

// "mouse"

// "mobile"
// "mouse"
// "moneypot"
// "monitor"
// "mousepad"
    
// m = ["mobile","moneypot","monitor"]
// mo = ["mobile","moneypot","monitor"]
// mou = ["mouse","mousepad"]
// mous = ["mouse","mousepad"]
// mouse = ["mouse","mousepad"]
139610