Suppose we have K elements numbered from 0 to K-1. An array called A with the size of n, contains at most K-1 of our elements. Find one excluded element in A in time of O(n)
