Practice Count the Number of Consistent Strings
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Easy#1684
LeetCode ProblemCount the Number of Consistent Strings
Problem Statement
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.
Source: Count the Number of Consistent Strings on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
allowed = "ab", words = ["ad","bd","aaab","baa","badab"]
Output
2
# Example 2
Input
allowed = "abc", words = ["a","b","c","ab","ac","bc","abc"]
Output
7
# Example 3
Input
allowed = "cad", words = ["cc","acd","b","ba","bac","bad","ac","d"]
Output
4
Constraints
1 <= words.length <= 10^4
1 <= allowed.length <= 26
1 <= words[i].length <= 10
The characters in allowed are distinct.
words[i] and allowed contain only lowercase English letters.
Related LeetCode Problems
Practice more problems similar to Count the Number of Consistent Strings.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.