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 = 3;
m = make_diamond(n);
assert(strcmp(char(0), m(2,2)))
assert(all(find(double(make_diamond(3)) == 0) == [1 3 5 7 9]') == 1)
ans =
ans =
|
2 | Pass |
%%
n = 9;
m = make_diamond(n);
assert(strcmp(char(0), m(5,5)))
ans =
|
3 | Pass |
%%
n = 35;
m = make_diamond(n);
assert(strcmp(char(0), m(15,15)))
ans =
|
190 Solvers
83 Solvers
Longest run of consecutive numbers
194 Solvers
208 Solvers
393 Solvers