to get the non repeating element we have to travese array atleast once.so Time complixity has to minimum o(n).as I suppose.. The XOr solution will fail because odd number will be there... Hashing itself require o(n) space in worst case.
On Mon, Apr 18, 2011 at 12:40 AM, sravanreddy001 <[email protected]>wrote: > can u explain ur solution with one of these sets? > > {1,2,1,3,2,1} > {1,2,1,3,2,2} > > an element can repeat for any number of times >= 2 > > -- > 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. > -- 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.
