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.
2 parents 3b90534 + f6ae92e commit b1ba2b2Copy full SHA for b1ba2b2
missing-number/Lustellz.ts
@@ -0,0 +1,21 @@
1
+// Runtime: 18ms
2
+// Memory: 58.64MB
3
+
4
+function missingNumber(nums: number[]): number {
5
+ const sortedNums: number[] = nums.sort((a, b) => a - b);
6
+ for(let i = 0; i <= nums.length; i++){
7
+ if(sortedNums[i] !== i) return i
8
+ }
9
+};
10
11
+// Runtime: 1ms
12
+// Memory: 58.34MB
13
+// reduce sum of array to find missing number
14
15
16
+ const n: number = nums.length;
17
+ const numSum: number = nums.reduce((acc, cur) => (acc += cur), 0);
18
+ const expectedSum: number = (n * (n + 1)) / 2;
19
20
+ return expectedSum - numSum;
21
+}
0 commit comments