This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 1;
y_correct =[7 9 11 13 15];
assert(isequal(your_fcn_name(x),y_correct))
y =
7 9 11 13 15
|
Find the longest sequence of 1's in a binary sequence.
2445 Solvers
1056 Solvers
1313 Solvers
616 Solvers
226 Solvers