Jewels and Stones (LeetCode May Challenge Day 2) | Programming Tutorials

LeetCode May Challenge - https://www.youtube.com/watch?v=Usm-QCwTQcg&list=PLUg9hRlm7gxSX8aXepxe54oslSpMvmyh4 Given two strings J and S. J - represents the type of stones that are jewels, S - represents the stones you have. Each character in S is a type of stone you have. You want to know how many of the stones you have are also jewels. The letters in J are guaranteed distinct, and all characters in J and S are letters. Letters are case sensitive, so "a" is considered a different type of stone from "A". For Example - Example 1: Input: J = "aA", S = "aAAbbbb" Output: 3 Example 2: Input: J = "z", S = "ZZ" Output: 0 Note: S and J will consist of letters and have length at most 50. The characters in J are distinct. Website - https://webrewrite.com/ Paypal - https://www.paypal.me/programmingtutorials