DSA in python Part 25

[@guruprasadnooliveedu]

macha 2 days nunchi series lo no videos

[@sritejacheemakurthy4784]

n=len(stones)
ans=0
for i in range(n):
if stones[i] in jewels:
ans+=1
return ans

[@vidadala3460]

class Solution:
def numJewelsInStones(self, jewels: str, stones: str) -> int:
ans = 0
for i in range(len(stones)):
if stones[i] in jewels:
ans += 1
return ans
What about this program machaa...Is this a proper approach???

[@sai807]

Super content Macha ❤