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;
y_correct = false;
assert(isequal(multipleof9(x),y_correct))
|
2 | Pass |
x = 9;
y_correct = true;
assert(isequal(multipleof9(x),y_correct))
|
3 | Pass |
x = 10;
y_correct = false;
assert(isequal(multipleof9(x),y_correct))
|
4 | Pass |
x = 111222;
y_correct = true;
assert(isequal(multipleof9(x),y_correct))
|
Return the 3n+1 sequence for n
5201 Solvers
Make an awesome ramp for a tiny motorcycle stuntman
262 Solvers
135 Solvers
185 Solvers
Conversion from hours to mili sec
90 Solvers