Problem
An array A contains n - 1 unique integers in the range [0,n - 1] , that is, there is one number from this range that is not in A. Design an O(n)-time algorithm for finding that number. You are only allowed to use O(1) additional space besides the array A itself.