Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [1 2; 3 4]; x1 = [4 3; 2 1];
y_correct = [ 8 5; 20 13];
assert(isequal(your_fcn_name(x, x1),y_correct))
|
Find the longest sequence of 1's in a binary sequence.
2446 Solvers
4112 Solvers
Back to basics 4 - Search Path
280 Solvers
244 Solvers
213 Solvers