Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [1 2 3 4 5 6 7];
xi = split_it(x);
assert(isequal(sum(x(xi)),sum(x)/2));
|
2 | Pass |
x = [2 2 2 2 2 2];
xi = split_it(x);
assert(isequal(sum(x(xi)),sum(x)/2));
|
3 | Pass |
x = [2 5 4 5 4];
xi = split_it(x);
assert(isequal(sum(x(xi)),sum(x)/2));
|
4 | Pass |
x = [1 3 1 1 9 7];
xi = split_it(x);
assert(isequal(sum(x(xi)),sum(x)/2));
|
5 | Pass |
x = primes(100);
xi = split_it(x);
assert(isequal(sum(x(xi)),sum(x)/2));
|
Find the alphabetic word product
2321 Solvers
1763 Solvers
Find best placement for ordered dominoes (harder)
205 Solvers
271 Solvers
343 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!