Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = [NaN 1 2 NaN 17 3 -4 NaN];
y_correct = [0 1 2 2 17 3 -4 -4];
assert(isequal(replace_nans(x),y_correct))
|
2 | Pass |
%%
x = [NaN 1 2 NaN NaN 17 3 -4 NaN];
y_correct = [ 0 1 2 2 2 17 3 -4 -4];
assert(isequal(replace_nans(x),y_correct))
|
3 | Pass |
%%
x = [NaN NaN NaN NaN];
y_correct = [ 0 0 0 0];
assert(isequal(replace_nans(x),y_correct))
|
4 | Pass |
%%
x = [1:10 NaN];
y_correct = [ 1:10 10];
assert(isequal(replace_nans(x),y_correct))
|
Find the alphabetic word product
1997 Solvers
543 Solvers
583 Solvers
Choose the best fitting dominoes
161 Solvers
467 Solvers