Cody

# Problem 43. Subset Sum

Solution 2137615

Submitted on 23 Feb 2020 by ZUNAED KIBRIA
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))

combination = 2 3 5 row = 3 column = 1 combination = 2 3 2 5 3 5 row = 3 column = 2 combination = 2 3 5 row = 1 column = 3 subset = 2 5 v = 2 NaN 5 subset = 2 3 v = 2 NaN NaN

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

combination = 5 3 2 row = 3 column = 1 combination = 5 3 5 2 3 2 row = 3 column = 2 combination = 5 3 2 row = 1 column = 3 subset = 3 v = 5 3 NaN

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

combination = 2 3 5 row = 3 column = 1 combination = 2 3 2 5 3 5 row = 3 column = 2 combination = 2 3 5 row = 1 column = 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))

combination = 1 1 1 1 1 row = 5 column = 1 combination = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 row = 10 column = 2 combination = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 row = 10 column = 3 combination = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 row = 5 column = 4 combination = 1 1 1 1 1 row = 1 column = 5 subset = 1 1 1 1 1 v = NaN 1 1 1 1 subset = 1 2 1 1 1 v = NaN NaN 1 1 1 subset = 1 2 3 1 1 v = NaN NaN NaN 1 1 subset = 1 2 3 4 1 v = NaN NaN NaN NaN 1 subset = 1 2 3 4 5 v = NaN NaN NaN NaN NaN

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

combination = 1 2 3 4 100 row = 5 column = 1 combination = 1 2 1 3 1 4 1 100 2 3 2 4 2 100 3 4 3 100 4 100 row = 10 column = 2 combination = 1 2 3 1 2 4 1 2 100 1 3 4 1 3 100 1 4 100 2 3 4 2 3 100 2 4 100 3 4 100 row = 10 column = 3 combination = 1 2 3 4 1 2 3 100 1 2 4 100 1 3 4 100 2 3 4 100 row = 5 column = 4 combination = 1 2 3 4 100 row = 1 column = 5 subset = 5 v = 1 2 3 4 NaN

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

combination = -7 -3 -2 8 5 row = 5 column = 1 combination = -7 -3 -7 -2 -7 8 -7 5 -3 -2 -3 8 -3 5 -2 8 -2 5 8 5 row = 10 column = 2 combination = -7 -3 -2 -7 -3 8 -7 -3 5 -7 -2 8 -7 -2 5 -7 8 5 -3 -2 8 -3 -2 5 -3 8 5 -2 8 5 row = 10 column = 3 combination = -7 -3 -2 8 -7 -3 -2 5 -7 -3 8 5 -7 -2 8 5 -3 -2 8 5 row = 5 column = 4 combination = -7 -3 -2 8 5 row = 1 column = 5 subset = 2 -2 5 v = -7 NaN -2 8 5 subset = 2 3 5 v = -7 NaN NaN 8 5 subset = 2 3 5 v = -7 NaN NaN 8 NaN