Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = sort(rand(1,10^5));
y_correct = 1;
assert(isequal(sortok(x),y_correct))
|
2 | Pass |
x = [1 5 4 3 8 7 3];
y_correct = 0;
assert(isequal(sortok(x),y_correct))
|
Find the longest sequence of 1's in a binary sequence.
3370 Solvers
Split a string into chunks of specified length
475 Solvers
238 Solvers
286 Solvers
274 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!