Watch 10 video solutions for Jewels and Stones, a easy level problem involving Hash Table, String. This walkthrough by Greg Hogg has 14,426 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
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.