This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [1 2 3 1];
y_correct = 1;
assert(isequal(checkvector(x),y_correct))
|
2 | Pass |
x = [1 2 7; 6 3 1];
y_correct = 0;
assert(isequal(checkvector(x),y_correct))
|
3 | Pass |
x = [1;2;0];
y_correct = 1;
assert(isequal(checkvector(x),y_correct))
|
Find the alphabetic word product
1998 Solvers
Sum all integers from 1 to 2^n
6334 Solvers
1392 Solvers
303 Solvers
284 Solvers