<p>You&#39;re given strings <code>jewels</code> representing the types of stones that are jewels, and <code>stones</code> representing the stones you have. Each character in <code>stones</code> is a type of stone you have. You want to know how many of the stones you have are also jewels.</p>

<p>Letters are case sensitive, so <code>&quot;a&quot;</code> is considered a different type of stone from <code>&quot;A&quot;</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> jewels = "aA", stones = "aAAbbbb"
<strong>Output:</strong> 3
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> jewels = "z", stones = "ZZ"
<strong>Output:</strong> 0
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;=&nbsp;jewels.length, stones.length &lt;= 50</code></li>
	<li><code>jewels</code> and <code>stones</code> consist of only English letters.</li>
	<li>All the characters of&nbsp;<code>jewels</code> are <strong>unique</strong>.</li>
</ul>

class Solution {
public:
    int numJewelsInStones(string jewels, string stones) {
        
        unordered_map<char,int> jewl;
        
        int b;
        
        for(char a: jewels){
            jewl[a] = 0;
        }
        
        for(char a:stones){
            if(jewl.find(a)!= jewl.end()){
                b = jewl[a];
                b++;
                jewl[a] = b;
            }
        }
        
        b = 0;
          for (const auto& pair : jewl){
              b += pair.second;
          }
        
        return b;
        
        
        
    }
};



/*class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int, int> dic;
        for (int i = 0; i < nums.size(); i++) {
            int num = nums[i];
            int complement = target - num;
            if (dic.find(complement) != dic.end()) {
                return {i, dic[complement]};
            }
            
            dic[num] = i;
        }
        
        return {-1, -1};
    }
}; */
8600