@Algo bard: No. You can do an O(n) time, O(n) space solution with a radix sort, or you can do an O(n log n) time, O(1) space solution with a variety of sorts. Dave
On Thursday, July 12, 2012 12:25:02 AM UTC-5, algo bard wrote: > Given an array of integers where some numbers repeat once, some numbers > repeat twice and only one number repeats thrice, how do you find the number > that gets repeated 3 times? > > Does this problem have an O(n) time and O(1) space solution? > No hashmaps please! > -- 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/-/f5b-1deuwdMJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
