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

public:
    // Solution* children[26];
    // bool isEnd;
    // Solution() {
    //     for (int i = 0; i < 26; i++)
    //         children[i] = NULL;
    //     isEnd = false;
    // }
    // void insert(string word) {
    //     Solution* curr = this;
    //     for (char c : word) {
    //         if (!(curr->children[c - 'a'])) {
    //             curr->children[c - 'a'] = new Solution();
    //         }
    //         curr = curr->children[c - 'a'];
    //     }
    //     curr->isEnd = true;
    // }
    bool startsWith(string prefix, string str) {

        int n = prefix.length();
        for (int i = 0; i < n; i++) {
            if (prefix[i] == str[i])
                continue;
            return false;
        }

        return true;
    }
    vector<vector<string>> suggestedProducts(vector<string>& products,
                                             string searchWord) {
        int word = searchWord.length();
        int n = products.size();
        // Solution* obj = new Solution();
        // for (int i = 0; i < n; i++) {
        //     obj->insert(products[i]);
        // }
        int i = 0;
        vector<vector<string>> ans;
        string temp;
        while (i < word) {
            temp += searchWord[i];
            vector<string> s;
            for (int j = 0; j < n; j++) {
                if (startsWith(temp, products[j])) {
                    s.push_back(products[j]);
                }
            }
            sort(s.begin(), s.end());
            if (s.size() > 3) {
                s.resize(3);
            }
            ans.push_back(s);
            i++;
        }
        return ans;
    }
};
614190