GeeksforGeeks » Algorithms
Subset Sum
(1 post)-
You are given an array of N integers. Now you want to find the sum of all those integers which can be expressed as the sum of at least one subset of the given array.
What can be the fastest way to do this?
Reply
You must log in to post.
