Missing Number

IF
AlgoAxiomStaff Engineers
JSTS
Easy20 mins

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

Examples

Example 1:

Input: nums = [3, 0, 1]

Output: 2

Explanation: n = 3, range is [0, 3]. The number 2 is missing.

Example 2:

Input: nums = [0, 1]

Output: 2

Explanation: n = 2, range is [0, 2]. The number 2 is missing.

Example 3:

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

Output: 8

Explanation: n = 9, range is [0, 9]. The number 8 is missing.

Constraints

  • n == nums.length
  • 1 <= n <= 10^4
  • 0 <= nums[i] <= n
  • All the numbers of nums are unique
Source: Cyclic Sort pattern — AlgoAxiom
JavaScript
Test Case 1
root = [1, 2, 3]
Test Case 2
root = [1, 2, 3, 4, 5]
Idle