From 0c7823bcfbebb4fe01a368eab49d254078464661 Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Mon, 15 May 2023 21:13:44 -0400 Subject: [PATCH] Create README - LeetHub --- .../README.md | 37 +++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 1684-count-the-number-of-consistent-strings/README.md diff --git a/1684-count-the-number-of-consistent-strings/README.md b/1684-count-the-number-of-consistent-strings/README.md new file mode 100644 index 0000000..e65890f --- /dev/null +++ b/1684-count-the-number-of-consistent-strings/README.md @@ -0,0 +1,37 @@ +

1684. Count the Number of Consistent Strings

Easy

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.

+ +

 

+

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

 

+

Constraints:

+ + +
\ No newline at end of file