Practice Problem
Missing Number
Difficulty: Easy
Given an array of n distinct numbers from the range [0, n], find the one number that is missing from the array.
Missing Number
Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.
Examples
Example 1:
Input: nums = [3, 0, 1]
Output: 2
Explanation: n = 3 since there are 3 numbers, so all numbers
are in the range [0, 3]. 2 is the missing number since it
does not appear in nums.Example 2:
Input: nums = [0, 1]
Output: 2
Explanation: n = 2 since there are 2 numbers, so all numbers
are in the range [0, 2]. 2 is the missing number since it
does not appear in nums.Example 3:
Input: nums = [9, 6, 4, 2, 3, 5, 7, 0, 1]
Output: 8
Explanation: n = 9 since there are 9 numbers, so all numbers
are in the range [0, 9]. 8 is the missing number since it
does not appear in nums.Constraints
n == nums.length1 <= n <= 10^40 <= nums[i] <= n- All the numbers of
numsare unique.
Expected Complexity
- Time: O(n)
- Space: O(1)
EASY
Bit Manipulation
XOR Tricks
Mathematics
Algorithms
Beginner
Free
0 views
Solution
Hints
Hint 1
Hint 2
Premium
Hint 3
Premium
Hint 4
Premium
This section is available for CodeSnatch Premium members only.