LC-1684 Easy LeetCode

1684. Count the Number of Consistent Strings

Array Hash Table String Bit Manipulation Counting

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 88% Topics: Array, Hash Table, String, Bit Manipulation, Counting

Reading material

Arrays & Hashing 12 min Strings 12 min Bit Manipulation 10 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

class Solution(object):
    def countConsistentStrings(self, allowed, words):
        """
        :type allowed: str
        :type words: List[str]
        :rtype: int
        """
        lookup = [False]*26
        for c in allowed:
            lookup[ord(c)-ord('a')] = True
        result = len(words)
        for word in words:
            for c in word:
                if not lookup[ord(c)-ord('a')]:
                    result -= 1
                    break
        return result

Solution from kamyu104/LeetCode-Solutions · MIT