Python // 6 lines easy and clear accepted solution // 276 ms // beats 95 %
\nclass Solution:\n    def numMatchingSubseq(self, S, words):\n        def check(s, i):\n            for c in s:\n                i = S.find(c, i) + 1\n        
```\nclass Solution:\n    def numMatchingSubseq(self, S, words):\n        def check(s, i):\n            for c in s:\n                i = S.find(c, i) + 1\n                if not i: return False\n            return True\n        return sum((check(word, 0) for word in words))\n```
[]