Algorithm for partitioning an array into subsets with target sums
Example: input = [2, 3, 3, 4, 5] sumTargets = [8, 6, 3] I want an algorithm to partition the input into subsets whose elements sum to the targets, in this case 8, 6 and 3. Both input and sumTargets can be of any size and it only needs to return one possible set of