Missing NumberEasy

Missing Number

Easy 10.2k64% acceptance

ArrayMathBit Manipulation

Given an array nums containing n distinct numbers drawn from the range [0, n], exactly one number in that range is missing. Return the missing number.

Example 1

Input: nums = [3,0,1]

Output: 2

n = 3, so the range is [0,3]; 2 is absent.

Example 2

Input: nums = [0,1]

Output: 2

n = 2, range [0,2]; 2 is absent.

Example 3

Input: nums = [9,6,4,2,3,5,7,0,1]

Output: 8

Constraints

n == nums.length
1 ≤ n ≤ 10⁴
0 ≤ nums[i] ≤ n
All numbers in nums are distinct.

Asked atAmazonMicrosoftAppleAdobe

JavaScript

⌘↵ to run

Loading editor…

Case 1

[3,0,1]

expected: 2

Case 2

[0,1]

expected: 2

Case 3

[9,6,4,2,3,5,7,0,1]

expected: 8

Case 4

[0]

expected: 1

Case 5

[1]

expected: 0

Case 6

[0,2,3,4,5]

expected: 1