This solution does not cover whole range of n.
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))
|
Given an unsigned integer x, find the largest y by rearranging the bits in x
524 Solvers
Back to basics 23 - Triangular matrix
532 Solvers
624 Solvers
223 Solvers
546 Solvers