C++ Easy Solution using String Find
\nclass Solution {\npublic:\n    int numMatchingSubseq(string s, vector<string>& words) {\n        int count=0;\n        size_t pos;\n        \n        if(s.emp
```\nclass Solution {\npublic:\n    int numMatchingSubseq(string s, vector<string>& words) {\n        int count=0;\n        size_t pos;\n        \n        if(s.empty())\n            return 0;\n        \n        for(const string& w: words){\n            if(w.empty())\n                continue;\n            \n            pos=0;\n            \n            for(char c: w){\n                pos=s.find(c,pos);\n                if(pos==string::npos)\n                    break;\n                pos++;\n            }\n            if(pos!=string::npos)\n                count++;\n        }\n        return count;\n    }\n};\n```
['C']