Solution: Jewels and Stones
Explore how to count jewels in the stones string by implementing a hash map solution. This lesson helps you understand member checking with sets, case-sensitive matching, and efficient iteration to solve common coding interview questions using hash maps.
We'll cover the following...
We'll cover the following...
Statement
You are given two strings, jewels and stones. Each character in jewels represents a stone type that is a jewel, and each character in stones represents a stone you have. Count how many characters in stones belong to the set of characters in jewels.
Note: Matching is case-sensitive, so
'a'and'A'are different types of stones.
Constraints:
...