<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:
    char data;
    map<int, TrieNode*> children;
    bool isEnd;

    TrieNode(): data('-'), isEnd(false) {};

    TrieNode(char c) {
        data = c;
        isEnd = false;
    }
};

class Trie {
public:
    TrieNode* root;

    Trie() {
        root = new TrieNode();
    }

    void insertWord(const string& word) {
        TrieNode* curr = root;
        for (char c : word) {
            int index = c - 'a';
            if (curr->children.find(index) == curr->children.end()) {
                curr->children[index] = new TrieNode(c);
            }
            curr = curr->children[index];
        }
        curr->isEnd = true;
    }

    vector<string> getSuggestions(const string& prefix) {
        vector<string> suggestions;
        TrieNode* curr = root;

        // Traverse the Trie to the end of the prefix
        for (char ch : prefix) {
            int index = ch - 'a';
            if (curr->children.find(index) == curr->children.end()) {
                return {}; // Prefix not found, return empty vector
            }
            curr = curr->children[index];
        }

        // Gather up to 3 suggestions starting from the current TrieNode
        gatherSuggestions(curr, prefix, suggestions);
        return suggestions;
    }

    void gatherSuggestions(TrieNode* curr, const string& prefix, vector<string>& suggestions) {
        if (!curr || suggestions.size() == 3) return;

        if (curr->isEnd) {
            suggestions.push_back(prefix);
        }

        for (auto& it : curr->children) {
            gatherSuggestions(it.second, prefix + it.second->data, suggestions);
        }
    }
};

class Solution {
public:
    vector<vector<string>> suggestedProducts(vector<string>& products, string searchWord) {
        Trie trie;

        // Insert all products into the Trie
        for (const string& s : products) {
            trie.insertWord(s);
        }

        vector<vector<string>> result;
        string prefix = "";

        for (char ch : searchWord) {
            prefix += ch;

            // Get suggestions for the current prefix
            vector<string> suggestions = trie.getSuggestions(prefix);
            result.push_back(suggestions);
        }

        return result;
    }
};


513050