I hadn't seen this approach to masking the complexity of a solution before. Obvious in hindsight of course.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = ones(2);
y_correct = 4;
assert(isequal(sumDiagonalElements(x),y_correct))
y =
4
ans =
[]
|
2 | Pass |
%%
x = ones(3);
y_correct = 5;
assert(isequal(sumDiagonalElements(x),y_correct))
y =
5
ans =
[]
|
3 | Pass |
%%
x = magic(8);
y_correct = 520;
assert(isequal(sumDiagonalElements(x),y_correct))
y =
520
ans =
[]
|
4 | Pass |
%%
x = magic(9);
y_correct = 697;
assert(isequal(sumDiagonalElements(x),y_correct))
y =
697
ans =
[]
|
10743 Solvers
2110 Solvers
794 Solvers
Back to basics 3 - Temp Directory
277 Solvers
403 Solvers