HAPPY NEW YEAR to all Geeks !!! Given an array of size N and a integer Num(K) . Need to find the combination of four no's in the array whose sum is equal to Num(K). Needed a solution whose complexity is less than O(n^3) .
-- 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.
