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 |
%%
x = 1;
y_correct = [1 1];
assert(isequal(your_fcn_name(x),y_correct))
|
2 | Pass |
%%
x = [0 -1 1 0 0 0 1 2];
y_correct = [0 0 -1 -1 1 1 0 0 0 0 0 0 1 1 2 2];
assert(isequal(your_fcn_name(x),y_correct))
|
1914 Solvers
Project Euler: Problem 5, Smallest multiple
241 Solvers
How many trades represent all the profit?
460 Solvers
265 Solvers
386 Solvers