# Leetcode 268 - Missing num

Note:

• To finish in O(1) space complexity.
• Calculate the sum first, then substract each num from it.

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:

Code: