📌 Easy Solution with Python
Intuition 🤔The task involves counting the number of “consistent strings” in the given words list. A string is considered “consistent” if it only contains charac
# Intuition 🤔
The task involves counting the number of “consistent strings” in the given words list. A string is considered “consistent” if it only contains characters from the allowed string. The problem is essentially a filtering task based on character membership.

# Approach 💡
1.	Initialize a counter: Start with a counter count set to 0 to track the number of consistent strings.

2.	Iterate through each word: For every word in the words list, check if all its characters belong to the allowed set.

3.	Flag for consistency: Use a flag to determine if a word contains any disallowed character:

    •	If a character is not in allowed, set the flag and stop checking    further.

4.	Update the counter: If the word is consistent (flag remains 0), increment the counter.

# Complexities ⏳
- Time complexity: $$O(n \cdot m)$$, where n is the number of words and m is the average length of a 


- Space complexity: $$O(1)$$, as only a few variables are used for tracking.

# Code
```python3 []
class Solution:
    def countConsistentStrings(self, allowed: str, words: List[str]) -> int:
        count = 0
        for word in words:
            flag = 0
            for char in word:
                if char not in allowed:
                    flag = 1

            if flag == 0:
                count += 1

        return count
```
['Array', 'Hash Table', 'String', 'Counting', 'Python3']