problem268

README

< Previous 　　　　　　　　　　　　　　　　 Next >

268. Missing Number (Easy)

Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.

Example 1:

Input: [3,0,1]
Output: 2

Example 2:

Input: [9,6,4,2,3,5,7,0,1]
Output: 8

Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?

Related Topics

[Bit Manipulation] [Array] [Math]

Similar Questions

1. First Missing Positive (Hard)
2. Single Number (Easy)
3. Find the Duplicate Number (Medium)
4. Couples Holding Hands (Hard)