Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
x = sort(rand(1,10^5));
y_correct = 1;
assert(isequal(sortok(x),y_correct))
|
2 | Fail |
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.
2446 Solvers
1529 Solvers
How to find the position of an element in a vector without using the find function
2323 Solvers
Generate a vector like 1,2,2,3,3,3,4,4,4,4
1571 Solvers
200 Solvers