Sync LeetCode submission Runtime - 0 ms (100.00%), Memory - 17.6 MB (53.24%)

Author: jimit105

0782-jewels-and-stones/README.md

@@ -0,0 +1,20 @@
+<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>

0782-jewels-and-stones/solution.py

@@ -0,0 +1,12 @@
+# Approach 2: Hash Set
+
+# m = len(jewels), n = len(stones)
+# Time: O(m + n)
+# Space: O(m)
+
+class Solution:
+    def numJewelsInStones(self, jewels: str, stones: str) -> int:
+        Jset = set(jewels)
+
+        return sum(s in Jset for s in stones)
+