We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e587045 commit e427212Copy full SHA for e427212
missing-number/hi-rachel.py
@@ -0,0 +1,38 @@
1
+"""
2
+TC: O(n)
3
+SC: O(n)
4
5
+from typing import List
6
+
7
8
+class Solution:
9
+ def missingNumber(self, nums: List[int]) -> int:
10
+ num_set = set(nums)
11
+ for i in range(len(nums)):
12
+ if i not in num_set:
13
+ return i
14
+ return len(nums)
15
16
17
18
+TC: O(n log n)
19
+SC: O(1)
20
21
22
23
+ nums.sort()
24
+ for idx, num in enumerate(nums):
25
+ if idx != num:
26
+ return idx
27
28
29
30
31
32
33
34
35
36
+ expected_sum = len(nums) * (len(nums) + 1) // 2
37
+ actual_sum = sum(nums)
38
+ return expected_sum - actual_sum
0 commit comments