This solution is outdated. To rescore this solution, sign in.
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));
|
2980 Solvers
Calculate the Levenshtein distance between two strings
456 Solvers
686 Solvers
546 Solvers
492 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!