I think this is the answer - http://stackoverflow.com/questions/5739024/finding-duplicates-in-on-time-and-o1-space
On Tuesday, October 30, 2012 2:27:29 PM UTC-4, Don wrote: > > Given an array of N integers in the range 0..N-1, determine if any > number is repeated in the array. > Solution should execute in O(n) time and use constant space. > Don > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/XPyEFSy1Gh0J. 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?hl=en.
