From eea6bdc26894a77a3a3adf6973d3a41733d9dacc Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Fri, 20 Jan 2023 16:50:19 -0500 Subject: [PATCH] Create README - LeetHub --- 771-jewels-and-stones/README.md | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 771-jewels-and-stones/README.md diff --git a/771-jewels-and-stones/README.md b/771-jewels-and-stones/README.md new file mode 100644 index 0000000..e13bd9a --- /dev/null +++ b/771-jewels-and-stones/README.md @@ -0,0 +1,21 @@ +
You're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have. Each character in stones is a type of stone you have. You want to know how many of the stones you have are also jewels.
Letters are case sensitive, so "a" is considered a different type of stone from "A".
+
Example 1:
+Input: jewels = "aA", stones = "aAAbbbb" +Output: 3 +
Example 2:
+Input: jewels = "z", stones = "ZZ" +Output: 0 ++
+
Constraints:
+ +1 <= jewels.length, stones.length <= 50jewels and stones consist of only English letters.jewels are unique.