I totally agree with manish here. question is missing the "key element" which makes it the "aha question". Without its just plain question doing it in O(n) space is no fun.
_dufus On Aug 11, 11:21 pm, manish bhatia <[email protected]> wrote: > Well instead of using extra memory, we can in-place sort the arraay in > O(nlog(n)) and then do an iteration (O(n)) to find out the repeated number. > But the catch is that number is repeated 2^i times. That is the hint we > should use > > ________________________________ > From: ankur aggarwal <[email protected]> > To: [email protected] > Sent: Sunday, 9 August, 2009 5:47:32 PM > Subject: [algogeeks] Re: Finding repeated element in most efficient way > > @richa.. > ques is in complete i think . > there shud be some conditions given .. > > otherwise > hash them > but lots of space will b wasted.. > > or sort them > > try to put the conditions.. > > > Yahoo! recommends that you upgrade to the new and safer Internet > Explorer 8.http://downloads.yahoo.com/in/internetexplorer/ --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
