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 | Fail |
n = 3;
y_correct = 3;
assert(isequal(closestPrime(n),y_correct))
|
2 | Fail |
n = 20;
y_correct = 23;
assert(isequal(closestPrime(n),y_correct))
|
3 | Fail |
n = 86;
y_correct = 89;
assert(isequal(closestPrime(n),y_correct))
|
4 | Pass |
n = 250;
y_correct = 251;
assert(isequal(closestPrime(n),y_correct))
|
357 Solvers
Reverse the elements of an array
563 Solvers
304 Solvers
3008 Solvers
103 Solvers