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

#include <vector>
#include <string>
#include <iostream>
using namespace std;

class Solution {
public:
    class TrieNode {
    public:
        char data;
        TrieNode* children[26];
        bool isTerminal;

        TrieNode(char ch) {
            data = ch;
            for(int i = 0; i < 26; i++) {
                children[i] = NULL;
            }
            isTerminal = false;
        }
    };

    class Trie {
    public:
        TrieNode* root;

        Trie() {
            root = new TrieNode('\0');
        }

        void insertUtil(TrieNode* root, const string& word) {
            if (word.empty()) {
                root->isTerminal = true;
                return;
            }

            int index = word[0] - 'a';
            TrieNode* child;

            if (root->children[index] != NULL) {
                child = root->children[index];
            } else {
                child = new TrieNode(word[0]);
                root->children[index] = child;
            }

            insertUtil(child, word.substr(1));
        }

        void insertWord(const string& word) {
            insertUtil(root, word);
        }

        void printSuggestion(TrieNode* curr, vector<string>& temp, string& prefix, int& count) {
            if (count >= 3) {
                return; // Stop if we already have 3 suggestions
            }
            if (curr->isTerminal) {
                temp.push_back(prefix);
                count++;
            }
            for (char ch = 'a'; ch <= 'z'; ch++) {
                TrieNode* next = curr->children[ch - 'a'];
                if (next != NULL) {
                    prefix.push_back(ch);
                    printSuggestion(next, temp, prefix, count);
                    prefix.pop_back();
                }
            }
        }

        vector<vector<string>> getSuggestion(const string& str) {
            TrieNode* prev = root;
            vector<vector<string>> output;
            string prefix = "";
            for (char lastCh : str) {
                prefix.push_back(lastCh);

                TrieNode* curr = (prev != NULL) ? prev->children[lastCh - 'a'] : NULL;

                if (curr == NULL) {
                    output.push_back({}); // Add an empty list for no suggestions
                    prev = NULL; // Ensure we don't process further
                } else {
                    vector<string> temp;
                    int count = 0; // Initialize count to 0
                    printSuggestion(curr, temp, prefix, count);
                    output.push_back(temp);
                    prev = curr;
                }
            }
            return output;
        }
    };

    vector<vector<string>> suggestedProducts(vector<string>& products, const string& searchWord) {
        Trie* t = new Trie();

        for (const string& str : products) {
            t->insertWord(str);
        }

        vector<vector<string>> result = t->getSuggestion(searchWord);

        // Cleanup
        delete t;

        return result;
    }
};


92930