all integers pairs in array that sum to given value say (k)...i have two sol for the array that contain unique elements..m asking should i take care of duplicates or not????coz my logic wont work for duplicates like if i have 0 1 2 3 4 5 6 8 8 if i want all pairs having some 8 ...den it should give(0,8) (0,8) two tymes or one tym is alryt????
On Sat, Oct 1, 2011 at 9:12 PM, shady <[email protected]> wrote: > what is the question > ??????????????????????????????????????????????????????????????????????????????????????????????? > > On Sat, Oct 1, 2011 at 9:08 PM, rahul sharma <[email protected]>wrote: > >> all pairs of integers sum upto x.....shiuld we take care of >> duplicates?????? >> >> -- >> 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.
