Jewels and Stones - Leetcode 771 - Hashmaps & Sets (Python)

Please check my playlists for free DSA problem solutions:

My Favorite Courses:

Data Structures & Algorithms:

Python:

Web Dev / Full Stack:

Cloud Development:

Game Development:

SQL & Data Science:

Machine Learning & AI:

[GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[jdratlif]

Wow. First time I've seen something leetcode says is "easy" that I also thought was easy.

[pedroaugustopereira]

Bro, frl, cause of your videos, im studying a lot with a dream of one day be a software enginner, bought today the book grooking algorithms, im reading and doing your algomap. U r great, thank u!

[БайМаринМилионера]

Is this any good?:
from collections import Counter

def solution(jewels: str, stones: str) -> int:
counter = Counter(stones)
count = 0

for j in jewels:
count += counter[j]
return count

[timkvernen]

def numJewelsInStones(self, jewels, stones):
jules = set(jewels)
return sum(1 for stone in stones if stone in jules)

[zodman]

why use set? the contrains said the jewels are unique, doesnt need to do set ...

[jojojux]

Why not using Counter?

from collections import Counter

def num_jewels_in_stones(jewels: str, stones: str):
stone_counter = Counter(stones)
return sum(stone_counter[jewel] for jewel in jewels)