Count the Number of Consistent Strings — LeetCode 1684 Python Solution

The problem

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.

Example

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'.

Python solution

class Solution:
    def countConsistentStrings(self, allowed: str, words: List[str]) -> int:
        s = set(allowed)
        return sum(all(c in s for c in w) for w in words)

Complexity

Pattern: Bit Manipulation

Use XOR, masks and the low-bit trick to replace whole data structures with an integer. LeetCode 1684. Count the Number of Consistent Strings is filed here because LeetCode tags it Bit Manipulation, which is the vocabulary this hub collects.

The bit manipulation guide has the Python template for the pattern and the 194 LeetCode problems that use it.

Related problems