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 3 4 5 31 67];
y_correct = [2 3 5 31 67];
assert(isequal(your_fcn_name(x),y_correct))
|
797 Solvers
468 Solvers
Project Euler: Problem 8, Find largest product in a large string of numbers
196 Solvers
204 Solvers
579 Solvers