i think we can solve this similar to finding the loop in linked list with two pointers.... hare and tortoise method ..

On 8/16/06, shashi_genius < [EMAIL PROTECTED]> wrote:

There are n numbers with all (n-1) unique numbers, except for one which
is repeating.
Find out  the repeating number in O(n) complexity.







--
with regards,
Balasubramaniam

A person who is original might be wrong, but a person who does not risk being wrong can never be right.....

Osho
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to