Problem 47415. List ways to reach a target sum
Given a vector of integers, how many ways are there to achieve or exceed a target sum? For example, if the vector is [3 6 10 11 15 16 16 20] and the target is 43, then a solution that hits the target is [6 10 11 16], and a solution that exceeds the target is [6 10 11 16 16 20]. How many more solutions are possible?
Write a function that takes a vector and a target sum and returns a cell array of possible solutions. The order of the solutions in the cell array is not important.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers5
Suggested Problems
-
3388 Solvers
-
1771 Solvers
-
Back to basics 12 - Input Arguments
611 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
427 Solvers
-
Implement a bubble sort technique and output the number of swaps required
343 Solvers
More from this Author311
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!