🔥Simple using Set, Subset🔥
Approach\n\n1. Given a list of words and a string allowed containing characters that are considered allowed.\n2. Utilize a list comprehension to iterate through
# Approach\n\n1. Given a list of words and a string allowed containing characters that are considered allowed.\n2. Utilize a list comprehension to iterate through each word x in the words list.\n3. For each word, create a set of its characters (`set(x)`) and check if this set is a ***subset*** of the set of allowed characters (`set(allowed)`).\n4. Sum the number of words for which the condition in step 3 is true.\n# Code\n```\nclass Solution:\n    def countConsistentStrings(self, allowed: str, words: List[str]) -> int:\n        return sum(1 for x in words if set(x).issubset(set(allowed)))\n```\nplease upvote :D
['Python3']