<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 TrieNode
{
    map<char, TrieNode*> children;
    bool isEndOfWord;
    
    TrieNode() : isEndOfWord(false) {}
};

class Trie
{
private:
    TrieNode *root;
    
    void findWordsWithPrefix(TrieNode* node, string currentWord, vector<string>& result) {
        // Nếu đã đủ 3 từ, ta dừng việc tìm kiếm
        if (result.size() >= 3) return;
        
        // Nếu node hiện tại là kết thúc của một từ, thêm từ này vào kết quả
        if (node->isEndOfWord) {
            result.push_back(currentWord);
        }
        
        // Duyệt qua tất cả các nhánh con của node hiện tại
        for (auto& child : node->children) {
            findWordsWithPrefix(child.second, currentWord + child.first, result);
        }
    }
    
public:
    Trie() {
        root = new TrieNode();
    }
    
    void insert(string word) {
        TrieNode *node = root;
        for (const char ch : word)
        {
            if (node->children.find(ch) == node->children.end())
            {
                node->children[ch] = new TrieNode();
            }
            
            node = node->children[ch];
        }
        
        node->isEndOfWord = true;
    }
    
    bool search(string word) {
        TrieNode *node = root;
        for (const char& ch : word)
        {
            if (node->children.find(ch) == node->children.end())
            {
                return false;
            }
            node = node->children[ch];
        }
        
        return node->isEndOfWord;
    }
    
    bool startsWith(string prefix) {
        TrieNode *node = root;
        for (const char& ch : prefix)
        {
            if (node->children.find(ch) == node->children.end())
            {
                return false;
            }
            node = node->children[ch];
        }
        return true;
    }

    vector<string> getWordsWithPrefix(string prefix) {
        vector<string> result;
        TrieNode *node = root;
        // Tìm nút cuối cùng tương ứng với prefix
        for (const char& ch : prefix)
        {
            if (node->children.find(ch) == node->children.end())
            {
                return result; // Trả về rỗng nếu không tìm thấy prefix
            }
            node = node->children[ch];
        }
        // Gọi hàm bổ trợ để tìm kiếm các từ bắt đầu bằng prefix
        findWordsWithPrefix(node, prefix, result);
        return result;
    }
};

class Solution
{
public:
    vector<vector<string>> suggestedProducts(vector<string>& products, string searchWord)
    {
        sort(products.begin(), products.end());

        Trie obj;
        vector<vector<string>> result;
        
        for (const string& str : products)
        {
            obj.insert(str);
        }
        
        string curr_word = "";
        for (int i = 0; i < searchWord.size(); i++)
        {
            curr_word += searchWord[i];
            
            vector<string> temp = obj.getWordsWithPrefix(curr_word);
//            sort(temp.begin(), temp.end());
            
            result.push_back(temp);
        }
        
        return result;
    }
};
544170