Problem 43. Subset Sum

Solution 57544

Submitted on 6 Mar 2012 by Jan

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Justin Winokur on 25 Jul 2013

well, I guess with Cody's way of scoring this would work, but honestly, a bit risky to use in "real life"

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))
2	Pass	%% v = [5, 3, 2]; n = 2; correct = 3; actual = subset_sum(v, n); assert(isequal(actual, correct))
3	Pass	%% v = [2, 3, 5]; n = 4; correct = []; actual = subset_sum(v, n); assert(isequal(actual, correct))
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))
5	Pass	%% v = [1, 2, 3, 4, 100]; n = 100; correct = 5; actual = subset_sum(v, n); assert(isequal(actual, correct))
6	Pass	%% v = [-7, -3, -2, 8, 5]; n = 0; correct = [2, 3, 5]; actual = subset_sum(v, n); assert(isequal(actual, correct))