Assuming there is only one element which i not repeated, my approach will need O(n) space... load all distinct elements and they counts as you traverse them first.. cost = O(n)
searching an element from this.. O(n) any better memory management here(i mean space) -- 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.
