how about using voters algorithm? TC O(n) and SC O(1) On Jul 16, 6:28 am, Anand Shastri <anand.shastr...@gmail.com> wrote: > Given a file containing 4,300,000,000 integers, how > can you *find **one* that *appears* at *least **twice*
-- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
