Missing Number
Easy
Bit Manipulation
•
NeetCode 150
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.

Constraints:

  • n == nums.length
  • 0 <= nums[i] <= n
  • All the numbers of nums are unique.