Easy aproach in python with discription
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []class Solution:\n    def countConsistentStrings(self, allowed: str, words: List[str]) -> int:\n        # Convert the allowed string into a set for faster membership testing\n        a = set(allowed)\n        \n        # Initialize the count of consistent words\n        c = 0\n        \n        # Iterate over each word in the list of words\n        for word in words:\n            # Check each letter in the current word\n            for letter in word:\n                # If the letter is not in the set of allowed characters, break out of the loop\n                if letter not in a:\n                    break\n            # If the loop completes without breaking, all letters in the word are allowed\n            else:\n                # Increment the count of consistent words\n                c += 1\n        \n        # Return the total count of consistent words\n        return c\n\n```
['Python3']