Python 3 One Pass, No Hash
\nclass Solution:\n    def numMatchingSubseq(self, s: str, words) -> int:\n        """\n        Given a string of lowercase letters (s) and an array\n        of
```\nclass Solution:\n    def numMatchingSubseq(self, s: str, words) -> int:\n        """\n        Given a string of lowercase letters (s) and an array\n        of words (words), this program determines the number\n        of words that are a subsequence of s.\n\n        :param s: string of lowercase letters\n        :type s: str\n        :param words: array of words\n        :type words: list[str]\n        :return: number of words that are a subsequence of s\n        :rtype: int\n        """\n        matches = 0\n        for word in words:\n            start = 0\n            found = True\n            for char in word:\n                location = s.find(char, start)\n                if location == -1:\n                    found = False\n                    break\n                start = location + 1\n            if found:\n                matches += 1\n        return matches\n\n```
['Python3']