Leetcode - Jewels and Stones Solution — The Poor Coder

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:

Text

Input: jewels = "aA", stones = "aAAbbbb"
Output: 3

Example 2:

Text

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.

Solution in Python#

Python

class Solution:
    def numJewelsInStones(self, jewels: str, stones: str) -> int:
        return sum(1 for i in stones if i in set(jewels))

May 112021

Leetcode - Count Good Meals Solution

A good meal is a meal that contains exactly two different food items with a sum of deliciousness equal to a power of two. You can pick any two different foods to make a good meal. Given an array of integers…

leetcode array Hash Table2 min read

May 112021

Leetcode - Number of Good Pairs Solution

Given an array of integers nums. A pair (i,j) is called good if nums[i] == nums[j] and i < j. Return the number of good pairs. Example 1: Example 2: Example 3: Constraints: 1 <= nums.length <= 100 1 <= nums[i] <= 100…

leetcode array Hash Table1 min read

May 112021

Leetcode - Making File Names Unique Solution

Given an array of strings names of size n. You will create n folders in your file system such that, at the ith minute, you will create a folder with the name names[i]. Since two files cannot have the same name, if you…

leetcode string Hash Table3 min read

Solution in Python#

Related posts

Leetcode - Count Good Meals Solution

Leetcode - Number of Good Pairs Solution

Leetcode - Making File Names Unique Solution