simple and easy C++ solution 😍❤️‍🔥
if it\'s help, please up \u2B06 vote! \u2764\uFE0F\n\n\n# Code\n\nclass Solution {\npublic:\n    bool findFuntions(string &s, string t) \n    {\n        int i =
# if it\'s help, please up \u2B06 vote! \u2764\uFE0F\n\n\n# Code\n```\nclass Solution {\npublic:\n    bool findFuntions(string &s, string t) \n    {\n        int i = 0, j = 0, n = s.size(), m = t.size();\n        while(j<n and i < m)\n            if(s[j++]==t[i]) i++;\n        return (t.size() - i) == 0;\n    }\n    int numMatchingSubseq(string s, vector<string>& words) \n    {\n        map<string,int>mp;\n        for(auto &str:words) mp[str]++;\n        \n        int ans = 0;\n        for(auto ok:mp)\n            if(findFuntions(s, ok.first)) ans += ok.second;\n        return ans;\n    }\n};\n```
['Array', 'Hash Table', 'String', 'Binary Search', 'C++']