Skip to content

Latest commit

 

History

History
73 lines (29 loc) · 1.26 KB

File metadata and controls

73 lines (29 loc) · 1.26 KB

Description

You're 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 also 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

Note:

    <li><code>S</code> and <code>J</code> will consist of letters and have length at most 50.</li>
    
    <li>The characters in <code>J</code> are distinct.</li>
    

Solutions

Python3

Java

...