0
For example, I have following array = 6,5,4,4,3,2,2,1 Sum =
10 there are a total of 8 ways 6,4 and 6,3,1 and 6,2,2 and 5,4,1 and 5,3,2 and 5,2,2,1
and 4,4,2 and 4,3,2,1 I have tried to solve it using a recursive approach
but i want to do it using dynamic programming
public static List<Set<I...