Skip to content

782. Jewels And Stones

Hash Table String

Problem - Jewels And Stones

Easy

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 <= 50
  • jewels and stones consist of only English letters.
  • All the characters of jewels are unique.

Solutions

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
class Solution:
    def numJewelsInStones(self, jewels: str, stones: str) -> int:
        # count = 0
        # set_stones = Counter(stones)
        # for i, num in set_stones.items():
        #     if i in jewels:
        #         count += num
        # return count
        set_jewels = set(jewels)
        return sum(char in set_jewels for char in stones)

Submission Stats:

  • Runtime: 0 ms (100.00%)
  • Memory: 17.9 MB (10.99%)