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 |
n = 13;
y_correct = 20;
assert(isequal(candyCount(n),y_correct))
|
2 | Pass |
n = 24;
y_correct = 36;
assert(isequal(candyCount(n),y_correct))
|
7266 Solvers
1878 Solvers
07 - Common functions and indexing 2
255 Solvers
Union of two set decreasing order
75 Solvers
Find remainder when x is divided by 3
65 Solvers