Perfect Sum Problem (Print all subsets with given sum) Given an array of integers and a sum, the task is to print all subsets
basically it is the problem of dynamic programming but can be solved by simple method.
Can you show an example?
search it on internet by currency Change algorithm
#kartikey [2,5,6,7,86,9,4,3] we have to count in how many ways the 9 can be formed 9 3,6 2,7 2,4,3 5,4