Skip to main content

< Back to Data Structures and Algorithms

LeetCode 771 · Strings

Jewels and Stones

How many stones are jewels, with the jewel types in a dictionary for quick lookups.

Step through it

Examples
Edge cases
jewels
  1. a0
  2. A1
stones
  1. a0
  2. A1
  3. A2
  4. b3
  5. b4
  6. b5
  7. b6

Step 0 of 9

Output

Running… play or step to the end.

The code

/**
 * Determines how many jewels exist within a variety of stones.
 * @param {string} jewels // Possible jewel types.
 * @param {string} stones // Could contain jewels.
 * @return {number}
 */
 const numJewelsInStones = (jewels, stones) => {
    // Keeps track of unique stone types.
    const jewelTypes = {}
    // Keeps track of the amount of jewels found within the stones.
    let numJewels = 0
    
    // O(n) loop over every possible jewel type.
    for (let i=0; i < jewels.length; i++) {
        // The jewel character.
        const jewel = jewels.charAt(i)
        
        // Jewel type doesn't exist in dictionary.
        if (!jewelTypes[jewel]) {
            // Save jewel type in dictionary.
            jewelTypes[jewel] = jewel
        }
    }
        
    // O(n) loop over every stone.
    for (let i=0; i < stones.length; i++) {
        // The stone character.
        const stone = stones.charAt(i)
        
        // Stone exists in jewels dictionary.
        if (jewelTypes[stone]) {
            // Jewel found.
            numJewels += 1
        }
    }
    
    // Found all possible jewels within the stones.
    return numJewels
}

View it on GitHub (opens in a new tab)