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”.
Input: J = “aA”, S = “aAAbbbb”
Input: J = “z”, S = “ZZ”
S and J will consist of letters and have length at most 50. The characters in J are distinct.
Time: O(J + S)
So there are 255 ascii codes and you are restriced to letters in this problem statement. If J or S could consist of Unicode characters then you should expand that to use a set or a dictionary instead of an array, but then the space complexity would jump to O(J) since now the size of the set or dictionary depends on the characters in J. The takeaway here is that the characters for A-Z are between 65 - 90 and a-z is from 97 - 122. You can create a fixed size array and then index into that array by subtracting a character’s ascii value by 97 or 65.