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 |
y=[4 4 4 3 3 3 5 5 5 2 9 7 12 6 6 5 1 3 3 3 21 ];
x_correct = [
4
4
4
3
3
3
5
5
5
6
6
6
8
8
8
3
3
3
9
9
9
];
assert(isequal(moving_average(y),x_correct))
x =
4 3 5 6 8 3 9
4 3 5 6 8 3 9
4 3 5 6 8 3 9
y =
4
4
4
3
3
3
5
5
5
6
6
6
8
8
8
3
3
3
9
9
9
|
2 | Pass |
y=[4 13 4 3 3 6 5 6 4 ];
x_correct = [ 7
7
7
4
4
4
5
5
5];
assert(isequal(moving_average(y),x_correct))
x =
7 4 5
7 4 5
7 4 5
y =
7
7
7
4
4
4
5
5
5
|
Project Euler: Problem 10, Sum of Primes
556 Solvers
378 Solvers
178 Solvers
136 Solvers
Basics: Divide integers to get integer outputs in all cases
92 Solvers