This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
This solution is outdated. To rescore this solution, sign in.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = [0 0 1 1 1 0];
y_correct = [0 0 1 2 1 0];
assert(isequal(distancesFromHoles(x),y_correct))
|
2 | Pass |
%%
x = [1 1 1 0 0 1 1 0 1 1 1 1 1 1 1];
y_correct = [1 2 1 0 0 1 1 0 1 2 3 4 3 2 1];
assert(isequal(distancesFromHoles(x),y_correct))
|
Find the alphabetic word product
1997 Solvers
244 Solvers
369 Solvers
324 Solvers
135 Solvers