Missing Number — Easy Coding Interview Question

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.

Example

Input: nums = [3,0,1]

Output: 2

Constraints

• n == nums.length
• 1 <= n <= 10^4
• 0 <= nums[i] <= n

Topics & Companies

Topics: arrays, bit-manipulation

Asked by: Microsoft, Amazon

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns