Given an unsorted array of integer containing positive and negative number both.
We Need to find out all the subsets (including non-contiguous subset) of the array, whose sum is equal to a given number. -Rohit -- 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.
