<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:
    def __init__(self):
        self.nodes = [None for _ in range(26)]
        self.isEndOfWord = False
        self.word = None

class Solution:
    def suggestedProducts(self, products: List[str], searchWord: str) -> List[List[str]]:

        root = TrieNode()
        for product in products:
            self.addWord(root, product)
        
        finalResult = []
        for i in range(1, len(searchWord) + 1):
            res = self.searchWordTrie(searchWord[0 : i], root)
            finalResult.append(res)
        
        return finalResult

    def addWord(self, root, word):

        for ch in word:
            chVal = ord(ch) - ord('a')
            if not root.nodes[chVal]:
                root.nodes[chVal] = TrieNode()
            root = root.nodes[chVal]
        root.isEndOfWord = True
        root.word = word
        return
    
    def searchWordTrie(self, prefix, root):

        for ch in prefix:
            chVal = ord(ch) - ord('a')
            root = root.nodes[chVal]
            if not root:
                return []
        
        self.result = []
        self.dfs(root)
        return self.result

    def dfs(self, root):
        if len(self.result) == 3:
            return
        if root.isEndOfWord:
            self.result.append(root.word)
        
        for each in root.nodes:
            if each:
                self.dfs(each)
        return
        
        
            
        

        
24200