@SkRiPt KiDdIe... see my 3rd post...i've mentioned that 1st we have to remove duplicate numbers....
On Mon, Jul 18, 2011 at 6:56 PM, SkRiPt KiDdIe <anuragmsi...@gmail.com>wrote: > > @Nishant: >>>> >>>> 1 4 5 4 5 n=5 >>>> >>>> 1 2 3 4 5 >>>> >>>> after xor i.e. your x1 answer contains (2^3^4^5).The missing elements >>>> are included in xor as well along with repeating elements. >>>> >>>> Hope now you got it. You are giving solution for a question which i have >>>> defined in previous post. and your algo will fail when >>>> the final xor has no set bit i.e. same number is being repeated 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. >> > > -- > 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. > -- 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.
