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.
2439 Solvers
Find all elements less than 0 or greater than 10 and replace them with NaN
11617 Solvers
1786 Solvers
Make an awesome ramp for a tiny motorcycle stuntman
262 Solvers
Find out sum of all elements of given Matrix
271 Solvers