<p>Given a string <code>s</code> and an array of strings <code>words</code>, return <em>the number of</em> <code>words[i]</code> <em>that is a subsequence of</em> <code>s</code>.</p>

<p>A <strong>subsequence</strong> of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.</p>

<ul>
	<li>For example, <code>&quot;ace&quot;</code> is a subsequence of <code>&quot;abcde&quot;</code>.</li>
</ul>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abcde&quot;, words = [&quot;a&quot;,&quot;bb&quot;,&quot;acd&quot;,&quot;ace&quot;]
<strong>Output:</strong> 3
<strong>Explanation:</strong> There are three strings in words that are a subsequence of s: &quot;a&quot;, &quot;acd&quot;, &quot;ace&quot;.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;dsahjpjauf&quot;, words = [&quot;ahjpjau&quot;,&quot;ja&quot;,&quot;ahbwzgqnuk&quot;,&quot;tnmlanowax&quot;]
<strong>Output:</strong> 2
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 5 * 10<sup>4</sup></code></li>
	<li><code>1 &lt;= words.length &lt;= 5000</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 50</code></li>
	<li><code>s</code> and <code>words[i]</code> consist of only lowercase English letters.</li>
</ul>

struct TrieNode{
    TrieNode* arr[26];
    int isEnd=0;
};
struct Trie{
    TrieNode* head;
    TrieNode* curr;
    Trie(){
        head = new TrieNode();
    }
    void add(string& s){
        curr=head;
        for(int i{};i<s.size();++i){
            if(curr->arr[s[i]-'a']==nullptr)curr->arr[s[i]-'a']= new TrieNode();
            curr=curr->arr[s[i]-'a'];
        }
        ++curr->isEnd;
        return;
    }
    int search(string s){
       curr=head;int count=0;
       queue<pair<TrieNode*,int>> q;
       q.push(make_pair(curr, 0));
       pair<TrieNode*,int> temp;
       while(!q.empty()){
            temp = q.front();q.pop();
            if(temp.first->isEnd){
                count+=temp.first->isEnd;
            }
            for(int i{};i<26;++i){
                if(temp.first->arr[i]!=nullptr){
                    for(int j{temp.second};j<s.size();++j){
                        if(s[j]-'a'==i){
                            q.push(make_pair(temp.first->arr[i], j+1));
                            break;
                        }
                    }
                }
            }
       }
        return count;
    }  
};
class Solution {
public:
    int numMatchingSubseq(string s, vector<string>& words) {
         Trie* trie = new Trie();
    for(int i{};i<words.size();++i)trie->add(words[i]);
    return trie->search(s);
    //return 0;
    }
};
275381