Despite the warning, I'm stoked it worked.
{Warning: Concatenation involves an empty array with an
incorrect number of rows.
This may not be allowed in a future release.}
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))
{Warning: Concatenation involves an empty array with an
incorrect number of rows.
This may not be allowed in a future release.}
{> In subset_sum at 13
In verifyCode>evaluateCode at 189
In verifyCode at 37
In fevalJSON at 14}

2  Pass 
%%
v = [5, 3, 2];
n = 2;
correct = 3;
actual = subset_sum(v, n);
assert(isequal(actual, correct))
{Warning: Concatenation involves an empty array with an
incorrect number of rows.
This may not be allowed in a future release.}
{> In subset_sum at 13
In verifyCode>evaluateCode at 189
In verifyCode at 37
In fevalJSON at 14}

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))
{Warning: Concatenation involves an empty array with an
incorrect number of rows.
This may not be allowed in a future release.}
{> In subset_sum at 13
In verifyCode>evaluateCode at 189
In verifyCode at 37
In fevalJSON at 14}

5  Pass 
%%
v = [1, 2, 3, 4, 100];
n = 100;
correct = 5;
actual = subset_sum(v, n);
assert(isequal(actual, correct))
{Warning: Concatenation involves an empty array with an
incorrect number of rows.
This may not be allowed in a future release.}
{> In subset_sum at 13
In verifyCode>evaluateCode at 189
In verifyCode at 37
In fevalJSON at 14}

6  Pass 
%%
v = [7, 3, 2, 8, 5];
n = 0;
correct = [2, 3, 5];
actual = subset_sum(v, n);
assert(isequal(actual, correct))
{Warning: Concatenation involves an empty array with an
incorrect number of rows.
This may not be allowed in a future release.}
{> In subset_sum at 13
In verifyCode>evaluateCode at 189
In verifyCode at 37
In fevalJSON at 14}

393 Solvers
Given an unsigned integer x, find the largest y by rearranging the bits in x
682 Solvers
Back to basics 25  Valid variable names
261 Solvers
516 Solvers
245 Solvers