<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 Trie:
    class Node:
        def __init__(self):
            self.isWord = False
            self.children = [None] * 26

    def __init__(self):
        self.Root = self.Node()
        self.curr = None
        self.resultBuffer = None

    def dfsWithPrefix(self, curr, word):
        if len(self.resultBuffer) == 3:
            return
        if curr.isWord:
            self.resultBuffer.append(word)
        for c in range(ord('a'), ord('z') + 1):
            if curr.children[c - ord('a')] is not None:
                self.dfsWithPrefix(curr.children[c - ord('a')], word + chr(c))

    def insert(self, s):
        self.curr = self.Root
        for c in s:
            if self.curr.children[ord(c) - ord('a')] is None:
                self.curr.children[ord(c) - ord('a')] = self.Node()
            self.curr = self.curr.children[ord(c) - ord('a')]
        self.curr.isWord = True

    def getWordsStartingWith(self, prefix):
        self.curr = self.Root
        self.resultBuffer = []
        for c in prefix:
            if self.curr.children[ord(c) - ord('a')] is None:
                return self.resultBuffer
            self.curr = self.curr.children[ord(c) - ord('a')]
        self.dfsWithPrefix(self.curr, prefix)
        return self.resultBuffer

class Solution:
    def suggestedProducts(self, products, searchWord):
        trie = Trie()
        result = []
        for w in products:
            trie.insert(w)
        prefix = ""
        for c in searchWord:
            prefix += c
            result.append(trie.getWordsStartingWith(prefix))
        return result
24800