## DEV Community is a community of 894,881 amazing developers

We're a place where coders share, stay up-to-date and grow their careers.

Posted on

# LeetCode : Jewels and Stones With Solutions

Hey🖐 DevCommunity Checkout The blog for solutions above Leetcode problem statement

## Problem Statement

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.

## Solution

``````class Solution {
public int numJewelsInStones(String jewels, String stones) {
int count= 0;
for (char jewel:jewels.toCharArray()) {
for (char stone:stones.toCharArray()) {
if(jewel==stone){
count++;
}
}

}
return count;
}
}
``````

### Conclusion

In this article, we learned way to solve LeetCode Problem Statement Jewels and Stones using java.