Practice Missing Number
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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. Follow up: Could you implement a solution using only O(1) extra space complexity and O(n) runtime complexity?
Source: Missing Number on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [3,0,1]
Output
2
# Example 2
Input
nums = [0,1]
Output
2
# Example 3
Input
nums = [9,6,4,2,3,5,7,0,1]
Output
8
Constraints
n == nums.length
1 <= n <= 10^4
0 <= nums[i] <= n
All the numbers of nums are unique.
Related LeetCode Problems
Practice more problems similar to Missing Number.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.