## Finding duplicates in an array using negation, single scan -O(n)

If the array elements are positive numbers and also elements are in the range 0 to n-1 , then we

If the array elements are positive numbers and also elements are in the range 0 to n-1 , then we

We have seen the Brute force and sorted array solutions for the problem statement, Now to even minimize the time

Duplicates in the array can be found by general Brute force solution in the O(n^2) time. Can there be any

Finding duplicates in an array is a common interview question. The problem statement can be defined as follows. Given an