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;
y_correct = 1;
assert(isequal(vecsum(x),y_correct))
|
| 2 | Pass |
x = [1 2 3 5];
y_correct = 11;
assert(isequal(vecsum(x),y_correct))
|
| 3 | Pass |
x = [1 2 3 5];
y_correct = 11;
assert(isequal(vecsum(x),y_correct))
|
| 4 | Pass |
x = 1:100;
y_correct = 5050;
assert(isequal(vecsum(x),y_correct))
|
Remove the small words from a list of words.
409 Solvers
321 Solvers
Project Euler: Problem 10, Sum of Primes
495 Solvers
Make a random, non-repeating vector.
353 Solvers
157 Solvers