This solution is outdated. To rescore this solution, sign in.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 1;
y_correct = roots([1 -2 1]);
assert(isequal(your_fcn_name(x),y_correct))
|
23031 Solvers
Sum all integers from 1 to 2^n
6334 Solvers
265 Solvers
414 Solvers
97 Solvers