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 |
%%
a = 3;
b = 4;
y_correct = 5;
assert(isequal(your_fcn_name(a,b),y_correct))
|
Find the longest sequence of 1's in a binary sequence.
2444 Solvers
1786 Solvers
397 Solvers
Project Euler: Problem 2, Sum of even Fibonacci
462 Solvers
354 Solvers