Sync LeetCode submission Runtime - 0 ms (100.00%), Memory - 17.7 MB (67.76%)

Author: jimit105

3581-the-two-sneaky-numbers-of-digitville/README.md

@@ -0,0 +1,50 @@
+<p>In the town of Digitville, there was a list of numbers called <code>nums</code> containing integers from <code>0</code> to <code>n - 1</code>. Each number was supposed to appear <strong>exactly once</strong> in the list, however, <strong>two</strong> mischievous numbers sneaked in an <em>additional time</em>, making the list longer than usual.<!-- notionvc: c37cfb04-95eb-4273-85d5-3c52d0525b95 --></p>
+
+<p>As the town detective, your task is to find these two sneaky numbers. Return an array of size <strong>two</strong> containing the two numbers (in <em>any order</em>), so peace can return to Digitville.<!-- notionvc: 345db5be-c788-4828-9836-eefed31c982f --></p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [0,1,1,0]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[0,1]</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The numbers 0 and 1 each appear twice in the array.</p>
+</div>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [0,3,2,1,3,2]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[2,3]</span></p>
+
+<p><strong>Explanation: </strong></p>
+
+<p>The numbers 2 and 3 each appear twice in the array.</p>
+</div>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [7,1,5,4,3,4,6,0,9,5,8,2]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[4,5]</span></p>
+
+<p><strong>Explanation: </strong></p>
+
+<p>The numbers 4 and 5 each appear twice in the array.</p>
+</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li data-stringify-border="0" data-stringify-indent="1"><code>2 &lt;= n &lt;= 100</code></li>
+	<li data-stringify-border="0" data-stringify-indent="1"><code>nums.length == n + 2</code></li>
+	<li data-stringify-border="0" data-stringify-indent="1"><code data-stringify-type="code">0 &lt;= nums[i] &lt; n</code></li>
+	<li data-stringify-border="0" data-stringify-indent="1">The input is generated such that <code>nums</code> contains <strong>exactly</strong> two repeated elements.</li>
+</ul>

3581-the-two-sneaky-numbers-of-digitville/solution.py

@@ -0,0 +1,17 @@
+# Approach 1: Hash Table
+
+# Time: O(n)
+# Space: O(n)
+
+class Solution:
+    def getSneakyNumbers(self, nums: List[int]) -> List[int]:
+        res = []
+        count = {}
+
+        for x in nums:
+            count[x] = count.get(x, 0) + 1
+            if count[x] == 2:
+                res.append(x)
+
+        return res
+