Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. For example, Given nums = [0, 1, 3] return 2 Follow up: Could you implement a solution using only O(1) extra space complexity and O(n) ru