<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:
    pair<int, int> search(string word, vector<string>& products, int start, int end){
        bool is_start_set = false;
        int new_start = -1;
        int new_end = -1;
        for(int i=start; i<=end; i++){
            if(products[i].size()<word.size()) continue;
            if(products[i].substr(0, word.size()) == word){
                if(!is_start_set){
                    new_start = i;
                    new_end = i;
                    is_start_set = true;
                } 
                else{
                    new_end++;
                }

            }
            else if(!is_start_set) continue;
            else break;
        }
        return make_pair(new_start, new_end);

    }
    vector<vector<string>> suggestedProducts(vector<string>& products, string searchWord) {
        sort(products.begin(), products.end());
        int start =0;
        int end = products.size()-1;
        vector<vector<string>> out;
        for(int i=0; i<searchWord.size(); i++){
            vector<string> sub_out;
            if(start == -1){ // No matches found for current substring and hence no matches will be found for substrings greater
                out.emplace_back(sub_out);
                continue;
            }
            pair<int, int> new_loc = search(searchWord.substr(0, i+1), products, start, end); // mou, products, 0, 4
            start = new_loc.first;
            end = new_loc.second;
            if(start == -1){ // No matches found for current substring and hence no matches will be found for substrings greater
                out.emplace_back(sub_out);
                continue;
            }
            cout<<start<<" "<<end<<endl;
            int counter = 0;
            for(int j=start; j<=end; j++){
                if (counter==3) break;
                sub_out.emplace_back(products[j]);
                counter++;
            }
            out.emplace_back(sub_out);
        }
        return out;
    }
};
38470