Find out which combinations of numbers in a set add up to a given total

Question

I\'ve been tasked with helping some accountants solve a common problem they have - given a list of transactions and a total deposit, which transactions are part of the depos

Answer 1

Its kind of like 0-1 Knapsack problem which is NP-complete and can be solved through dynamic programming in polynomial time.

http://en.wikipedia.org/wiki/Knapsack_problem

But at the end of the algorithm you also need to check that the sum is what you wanted.