Cody

# Problem 43. Subset Sum

Solution 2077818

Submitted on 3 Jan 2020 by Andreas Neul
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
v = [2, 3, 5]; n = 8; correct = [2, 3]; actual = subset_sum(v, n); assert(isequal(actual, correct))

v_sort = 1×3 int8 row vector 2 3 5 v_sort_idx = 1 2 3

2   Pass
v = [5, 3, 2]; n = 2; correct = 3; actual = subset_sum(v, n); assert(isequal(actual, correct))

v_sort = 1×3 int8 row vector 2 3 5 v_sort_idx = 3 2 1

3   Pass
v = [2, 3, 5]; n = 4; correct = []; actual = subset_sum(v, n); assert(isequal(actual, correct))

v_sort = 1×3 int8 row vector 2 3 5 v_sort_idx = 1 2 3

4   Pass
v = [1, 1, 1, 1, 1]; n = 5; correct = [1, 2, 3, 4, 5]; actual = subset_sum(v, n); assert(isequal(actual, correct))

v_sort = 1×5 int8 row vector 1 1 1 1 1 v_sort_idx = 1 2 3 4 5

5   Pass
v = [1, 2, 3, 4, 100]; n = 100; correct = 5; actual = subset_sum(v, n); assert(isequal(actual, correct))

v_sort = 1×5 int8 row vector 1 2 3 4 100 v_sort_idx = 1 2 3 4 5

6   Pass
v = [-7, -3, -2, 8, 5]; n = 0; correct = [2, 3, 5]; actual = subset_sum(v, n); assert(isequal(actual, correct))

v_sort = 1×5 int8 row vector -7 -3 -2 5 8 v_sort_idx = 1 2 3 5 4

### Community Treasure Hunt

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

Start Hunting!