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 = [2,1];
y_correct = fft(x);
assert(isequal(fast_furier(x),y_correct))
|
Find the alphabetic word product
1997 Solvers
960 Solvers
Increment a number, given its digits
505 Solvers
534 Solvers
811 Solvers