#1684
Count the Number of Consistent Strings
newbie · 100 · lc easy +12 · premium · verified · 88.5% accepted · 2,270 likes · top 99%
Description
Given a string allowed of distinct characters and an array of strings words, a word is consistent if every character it contains also appears in allowed. Return the count of consistent strings in 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.
Code
1
2
3