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 comments
Loading...
Problem Recent Solvers8
Suggested Problems
-
Read a column of numbers and interpolate missing data
2356 Solvers
-
Back to basics 22 - Rotate a matrix
939 Solvers
-
Back to basics 25 - Valid variable names
340 Solvers
-
Return elements unique to either input
817 Solvers
-
944 Solvers
More from this Author328
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
