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 |
x = [1 -2 1];
y_correct = [1;1];
assert(isequal(solvepol(x),y_correct))
|
2 | Pass |
x = [1 -3 2];
y_correct = [2;1];
assert(isequal(solvepol(x),y_correct))
|
Back to basics 8 - Matrix Diagonals
707 Solvers
Number of 1s in a binary string
1232 Solvers
579 Solvers
197 Solvers
244 Solvers