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))
|
17159 Solvers
1318 Solvers
Find nearest prime number less than input number
183 Solvers
302 Solvers
216 Solvers