Sync LeetCode submission Runtime - 11 ms (53.86%), Memory - 31.5 MB (42.56%)

Author: jimit105

0217-contains-duplicate/README.md

@@ -2,15 +2,37 @@
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
-<pre><strong>Input:</strong> nums = [1,2,3,1]
-<strong>Output:</strong> true
-</pre><p><strong class="example">Example 2:</strong></p>
-<pre><strong>Input:</strong> nums = [1,2,3,4]
-<strong>Output:</strong> false
-</pre><p><strong class="example">Example 3:</strong></p>
-<pre><strong>Input:</strong> nums = [1,1,1,3,3,4,3,2,4,2]
-<strong>Output:</strong> true
-</pre>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [1,2,3,1]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">true</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The element 1 occurs at the indices 0 and 3.</p>
+</div>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [1,2,3,4]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">false</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>All elements are distinct.</p>
+</div>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [1,1,1,3,3,4,3,2,4,2]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">true</span></p>
+</div>
+
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>
 

0217-contains-duplicate/solution.py

@@ -1,10 +1,16 @@
+# Approach 3: Hash Set
+
+# Time: O(n)
+# Space: O(n)
+
 class Solution:
     def containsDuplicate(self, nums: List[int]) -> bool:
         visited = set()
-        
+
         for num in nums:
             if num in visited:
                 return True
-            else:
-                visited.add(num)
+            visited.add(num)
+
         return False
+