Question: An array A contains n1 unique integers in the range [0,n1], that is, there is one number from this range that is not in A.
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.
Step by Step Solution
3.50 Rating (163 Votes )
There are 3 Steps involved in it
First calculate the sum n 1 i1 ... View full answer
Get step-by-step solutions from verified subject matter experts
