already answered one day back, present in archives.... ********* EOD **********
On Wed, Aug 15, 2012 at 2:38 AM, ragavenderan venkatesan < [email protected]> wrote: > Okk > > So how can we go about this problem then > > Given an array of 32bit unsigned integers in which every number appears > exactly twice except three of them, find those three numbers in O(n) time > using O(1) extra space. The input array is read-only. What if there are k > exceptions instead of 3? > > > > On Tue, Aug 14, 2012 at 2:07 PM, Arpit Sood <[email protected]> wrote: > >> no, because there is more than one possibility. >> >> >> On Wed, Aug 15, 2012 at 2:34 AM, ragavenderan venkatesan < >> [email protected]> wrote: >> >>> for 2 numbers? >>> >>> >>> On Tue, Aug 14, 2012 at 2:00 PM, shady <[email protected]> wrote: >>> >>>> not possible. >>>> >>>> On Wed, Aug 15, 2012 at 2:26 AM, ragavenderan venkatesan < >>>> [email protected]> wrote: >>>> >>>>> Given Xor of 3 numbers, How can we derive back those 3 numbers? >>>>> Can any one explain with an example? >>>>> >>>>> >>>>> Thanks >>>>> >>>>> Ragavenderan >>>>> >>>>> -- >>>>> 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. >>>> >>> >>> -- >>> 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, >> Arpit Sood >> >> -- >> 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. > -- 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.
