@Sunny: what if the number is repeated multiple times? u seem to consider only the duplicates(2 times).
On Jun 13, 7:36 pm, sunny agrawal <[email protected]> wrote: > no we can take care of duplicates without any extra memory > modify 2nd step of my previous solution as follows > > if T[a[i]] is set then this element is there in second array so report this > element and Reset T[a[i]]. > > now no duplicates will be reported. and only 1025 bits will be required. > any failures ?? > > -- > Sunny Aggrawal > B-Tech IV year,CSI > Indian Institute Of Technology,Roorkee -- 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.
