I have searched this group for this particular problem but couldn't find it. So here it is: We have an array of numbers with exactly one of those numbers being duplicated and rest being unique. How do we find that number. From what I heard, the solution is better than the obvious O(n log(n)).
- [algogeeks] Finding duplicate pramod
