This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
good!
nice one
nice!!
| Test | Status | Code Input and Output |
|---|---|---|
| 1 | Pass |
assert(isequal(times2(1),2));
|
| 2 | Pass |
assert(isequal(times2(11),22));
|
| 3 | Pass |
assert(isequal(times2(-3),-6));
|
| 4 | Pass |
assert(isequal(times2(29),58));
|
Find all elements less than 0 or greater than 10 and replace them with NaN
10821 Solvers
Find the alphabetic word product
1865 Solvers
156 Solvers
Back to basics 23 - Triangular matrix
491 Solvers
194 Solvers