Assuming only one non-repeating element just run over the n elements and keep xoring only the non repeated one will be left. O(1) space, O(n) time
On Sat, Apr 16, 2011 at 11:34 PM, sravanreddy001 <[email protected]>wrote: > 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 [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. > -- Regards Gunjan Sharma Chairman IEEE Students Chapter IIT Roorkee B.Tech IV year CSE Contact No- +91 9997767077 -- 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?hl=en.
