very creative solution
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))
|
Extract leading non-zero digit
967 Solvers
Project Euler: Problem 10, Sum of Primes
556 Solvers
269 Solvers
469 Solvers
Detect a number and replace with two NaN's
157 Solvers