Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 1;
y_correct = 1;
assert(isequal(which_doors_open(x),y_correct))
y =
1
|
2 | Pass |
x = 3;
y_correct = 1;
assert(isequal(which_doors_open(x),y_correct))
y =
1
|
3 | Pass |
x = 100;
y_correct = [1 4 9 16 25 36 49 64 81 100];
assert(isequal(which_doors_open(x),y_correct))
y =
1 4 9 16 25 36 49 64 81 100
|
Find the longest sequence of 1's in a binary sequence.
3369 Solvers
1223 Solvers
Project Euler: Problem 2, Sum of even Fibonacci
835 Solvers
The Answer to Life, the Universe, and Everything
383 Solvers
2770 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!