Hi, here is the solution. 1. Create a hashtable . 2. Go through the numbers inserting each into the hashtable. When insert the number check if it already exists, if so - this is the repeating number.
The complexity: O(k*n) = O(n) --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
