Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 1;
y_correct = 1;
assert(isequal(which_doors_open(x),y_correct))
|
2 | Pass |
x = 3;
y_correct = 1;
assert(isequal(which_doors_open(x),y_correct))
|
3 | Pass |
x = 100;
y_correct = [1 4 9 16 25 36 49 64 81 100];
assert(isequal(which_doors_open(x),y_correct))
|
Find the longest sequence of 1's in a binary sequence.
2444 Solvers
177 Solvers
214 Solvers
204 Solvers
Check that number is whole number
274 Solvers