Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [0 1 2 3 4];
assert(isequal(mono_increase(x),true));
|
2 | Pass |
x = [0];
assert(isequal(mono_increase(x),true));
|
3 | Pass |
x = [0 0 0 0 0];
assert(isequal(mono_increase(x),false));
|
4 | Pass |
x = [0 1 2 3 -4];
assert(isequal(mono_increase(x),false));
|
5 | Pass |
x = [-3 -4 2 3 4];
assert(isequal(mono_increase(x),false));
|
6 | Pass |
x = 1:.1:10;
assert(isequal(mono_increase(x),true));
|
7 | Pass |
x = cumsum(rand(1,100));
x(5) = -1;
assert(isequal(mono_increase(x),false));
|
8 | Pass |
x = cumsum(rand(1,50));
assert(isequal(mono_increase(x),true));
|
Back to basics 23 - Triangular matrix
532 Solvers
Return elements unique to either input
478 Solvers
Longest run of consecutive numbers
200 Solvers
We love vectorized solutions. Problem 1 : remove the row average.
385 Solvers
600 Solvers