https://github.com/emilwijayasekara/leetcode-771-jewels-and-stones

LeetCode Problem 771. Jewels and Stones - The task is to count how many stones in a given string are considered jewels based on a separate string of jewel types. The solution involves comparing characters in both strings and tallying the matches.
https://github.com/emilwijayasekara/leetcode-771-jewels-and-stones

java leetcode leetcode-java leetcode-solutions

Last synced: 2 days ago
JSON representation

LeetCode Problem 771. Jewels and Stones - The task is to count how many stones in a given string are considered jewels based on a separate string of jewel types. The solution involves comparing characters in both strings and tallying the matches.

• Host: GitHub
• URL: https://github.com/emilwijayasekara/leetcode-771-jewels-and-stones
• Owner: EmilWijayasekara
• Created: 2024-01-14T17:00:49.000Z (10 months ago)
• Default Branch: main
• Last Pushed: 2024-01-14T17:08:57.000Z (10 months ago)
• Last Synced: 2024-01-14T22:06:21.220Z (10 months ago)
• Topics: java, leetcode, leetcode-java, leetcode-solutions
• Language: Java
• Homepage: https://leetcode.com/problems/jewels-and-stones/description/
• Size: 2.93 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# LeetCode Practice  (Day 22)

## Achievements

[![Leetcode-copy.jpg](https://i.postimg.cc/PJhVpCTq/Leetcode-copy.jpg)](https://postimg.cc/VrGW2LSy)

## About the problem

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**.

## Approach Explanation

In the problem by using nested loops to iterate through each character in both the `jewels` and `stones` strings. For each character in `jewels`, I checked if it matched any character in `stones`, and if so, incremented a counter. This counter represents the count of stones that are also jewels. My approach is straightforward and involves a systematic comparison of each character in the two strings, providing a clear and direct solution to the problem. While effective, it's worth noting that there are more optimized approaches using data structures like sets to enhance efficiency, especially for larger inputs.

### If you have suggestions for improvement or would like to contribute to this solution, feel free to create a pull request. 🙌😇