if sum of all elements = n(n-1)/2 , no elements are repeated
else some numbers are repeated
On Tue, Oct 30, 2012 at 11:57 PM, Don dondod...@gmail.com wrote:
Given an array of N integers in the range 0..N-1, determine if any
number is repeated in the array.
Solution should execute in O(n) time
http://www.geeksforgeeks.org/archives/17743
Using the above problem we get all possible merges , at each possible
merge, we can calculate the sum.
On 7/11/12, Mr.B sravanreddy...@gmail.com wrote:
I think you missed the question:
Its a stable merge. (order of elements in each array should be
