Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1684 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1684 # by problem number
lcpy gen -s count_the_number_of_consistent_strings # by problem name
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.
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'.
Input: allowed = "abc", words = ["a","b","c","ab","ac","bc","abc"]
Output: 7
Explanation: All strings are consistent.
Input: allowed = "cad", words = ["cc","acd","b","ba","bac","bad","ac","d"]
Output: 4
Explanation: Strings "cc", "acd", "ac", and "d" are consistent.
class Solution:
# Time: O(n * m) where n = len(words), m = max word length
# Space: O(1) since allowed is at most 26 characters
def count_consistent_strings(self, allowed: str, words: list[str]) -> int:
allowed_mask = 0
for ch in allowed:
allowed_mask |= 1 << (ord(ch) - ord("a"))
count = 0
for word in words:
word_mask = 0
for ch in word:
word_mask |= 1 << (ord(ch) - ord("a"))
if word_mask | allowed_mask == allowed_mask:
count += 1
return count
| Time | Space |
|---|---|
| O(n * m) where n = len(words), m = max word length | O(1) since allowed is at most 26 characters |