This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
How does this work?
This is precomputation, lookup table. Quite common method, when input variable is from small set(and computation long and hard). Now I think it is cheating in this competition, sorry:]
| Test | Status | Code Input and Output |
|---|---|---|
| 1 | Pass |
%%
a = 1;
b = 2;
out = sumDigits(a);
assert(isequal(out, b))
|
| 2 | Pass |
%%
a = 10;
b = 7;
out = sumDigits(a);
assert(isequal(out, b))
|
| 3 | Pass |
%%
a = 16;
b = 25;
out = sumDigits(a);
assert(isequal(out, b))
|
32599 Solvers
Find the peak 3n+1 sequence value
619 Solvers
1391 Solvers
Back to basics 11 - Max Integer
582 Solvers
389 Solvers