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.
Solve

Solution Stats

26 Solutions

8 Solvers

Last Solution submitted on Jul 16, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers8

Chris Cleveland George Berken David Hill Lorenzo

Suggested Problems

More from this Author329

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!