This solution is outdated. To rescore this solution, sign in.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 5;
a = [ 1 2 3 4 5;
10 9 8 7 6;
11 12 13 14 15;
20 19 18 17 16;
21 22 23 24 25];
assert(isequal(a,back_and_forth(n)));
|
Find the longest sequence of 1's in a binary sequence.
3370 Solvers
What is the next step in Conway's Life?
640 Solvers
445 Solvers
486 Solvers
2047 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!