Using Solution of Problem 392 : Is Subsequence
\nclass Solution:\n    def numMatchingSubseq(self, s: str, words: List[str]) -> int:\n        result = []\n        for word in words:\n            if self.isSub
```\nclass Solution:\n    def numMatchingSubseq(self, s: str, words: List[str]) -> int:\n        result = []\n        for word in words:\n            if self.isSubsequence(word, s):\n                result.append(word)\n        return len(result)\n    \n\t# Taken from Problem 392 Solution\n    @lru_cache\n    def isSubsequence(self, s: str, t: str) -> bool:\n        if not s:\n            return True\n        index = 0\n        for j in range(len(t)):\n            if s[index] == t[j]:\n                index += 1\n            if index == len(s):\n                return True\n        return False\n```
['Python']