Given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character in S is a type of stone you have. You want to know how many of the stones you have are jewels.

The letters in J are guaranteed distinct, and all characters in J and S are letters. Letters are case sensitive, so "a" is considered a different type of stone from "A".

Example 1: Input: J = "aA", S = "aAAbbbb" Output: 3 Example 2: Input: J = "z", S = "ZZ" Output: 0

Solution submitted by Dzeng at March 28, 2020, 11:23 p.m.

```
j = 'abc'
s = 'aaAAbBBB'
jcount = 0
for i in j:
jcount += s.count(i)
print(jcount)
```

You need login to submit your solution

Doubles

Shift Code

Sum Of Consecutive Prime Numbers

Find PI

Safest Positions

Largest Number Obtained

Integer Solutions Of Equation

Split a String in Balanced Strings

Jewels and Stones

Sort List By Parity

Mose Code Words

Steps To Zero

Prime Number List

First Nonconsective Number

Progress Bar

You need login to comment