Number of Matching Subsequences Python Easy
Upvote if Useful\n\n\n```\nclass Solution:\n    def numMatchingSubseq(self, s: str, words: List[str]) -> int:\n        def issub(x, y):\n            it = iter(y
# Upvote if Useful\n![image](https://assets.leetcode.com/users/images/8fd98169-6920-47c8-9c86-38762b210251_1624357908.4333959.png)\n\n```\nclass Solution:\n    def numMatchingSubseq(self, s: str, words: List[str]) -> int:\n        def issub(x, y):\n            it = iter(y)\n            return all(c in it for c in x)\n        c=0\n        wordsset = set(words)\n        for i in wordsset:\n            if issub(i,s):\n                c = c+words.count(i)\n        return c
['Iterator', 'Ordered Set', 'Python', 'Python3']