This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
I think HIST would be more correct here than HISTC, as HIST takes bin centres as an argument, rather than bin edges.
But this is a very clever solution. I'm using min:max as bin centres, quite a bit longer!
| Test | Status | Code Input and Output |
|---|---|---|
| 1 | Pass |
%%
x = [1 2 5 2 2 7 8 3 3 1 3 8 8 8];
y_correct = [2 3];
assert(isequal(threeTimes(x),y_correct))
|
| 2 | Pass |
%%
x = [1 1 1];
y_correct = [1];
assert(isequal(threeTimes(x),y_correct))
|
| 3 | Pass |
%%
x = [5 10 -3 10 -3 11 -3 5 5 7];
y_correct = [-3 5];
assert(isequal(threeTimes(x),y_correct))
|
132 Solvers
1648 Solvers
313 Solvers
222 Solvers
281 Solvers