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 = magic(5);
y_correct = 25;
assert(isequal(your_fcn_name(x),y_correct))
y =
25
|
2 | Pass |
x = [2 4 9 0 7 19;3 4 1 2 0 6];
y_correct = 19;
assert(isequal(your_fcn_name(x),y_correct))
y =
19
|
3 | Pass |
x = [2 4 9 0 7 19;3 4 1 2 0 6]';
y_correct = 19;
assert(isequal(your_fcn_name(x),y_correct))
y =
19
|
Maximum running product for a string of numbers
817 Solvers
Find state names that end with the letter A
553 Solvers
466 Solvers
Return unique values without sorting
488 Solvers
172 Solvers