1684.py

"""
You are given a string allowed consisting of distinct characters and an array of strings words. A string is consistent if all characters in the string appear in the string allowed.

Return the number of consistent strings in the array words.



Example 1:

Input: allowed = "ab", words = ["ad","bd","aaab","baa","badab"]
Output: 2
Explanation: Strings "aaab" and "baa" are consistent since they only contain characters 'a' and 'b'.
Example 2:

Input: allowed = "abc", words = ["a","b","c","ab","ac","bc","abc"]
Output: 7
Explanation: All strings are consistent.
Example 3:

Input: allowed = "cad", words = ["cc","acd","b","ba","bac","bad","ac","d"]
Output: 4
Explanation: Strings "cc", "acd", "ac", and "d" are consistent.


Constraints:

1 <= words.length <= 104
1 <= allowed.length <= 26
1 <= words[i].length <= 10
The characters in allowed are distinct.
words[i] and allowed contain only lowercase English letters.
"""

from typing import List


class Solution:
    def countConsistentStrings(self, allowed: str, words: List[str]) -> int:
        # table = {}
        # qtd = 0

        # # time complexity -> O(m * n) -> O(n)
        # for char in allowed:
        #     table[char] = 0

        # for word in words:
        #     for letter in word:
        #         if table.get(letter) is None:
        #             break
        #     else:
        #         qtd += 1

        # return qtd
        bitset = 0
        qtd = len(words)

        for char in allowed:
            bitset |= 1 << (ord(char) - 97)

        # print("{0:b}".format(bitset))

        for word in words:
            for char in word:
                if bitset & (1 << ord(char) - 97) == 0:
                    qtd -= 1
                    break

        return qtd


print(
    Solution().countConsistentStrings(
        allowed="ab", words=["ad", "bd", "aaab", "baa", "badab"]
    )
)