Test  Status  Code Input and Output 

1  Fail 
x = [1 0 1 3 2 3 1];
window = 2;
y_correct = 3;
assert(isequal(sum_positive(x, window),y_correct))
t =
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0

2  Fail 
x = [1 0 1 3 2 3 1];
window = 3;
y_correct = 3;
assert(isequal(sum_positive(x, window),y_correct))

3  Fail 
x = [1 0 1 3 2 3 1];
window = 4;
y_correct = 4;
assert(isequal(sum_positive(x, window),y_correct))

4  Fail 
x = [1 0 1 3 2 3 1 1 1 1 1 1];
window = 2;
y_correct = 8;
assert(isequal(sum_positive(x, window),y_correct))
t =
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0
0 0

Maximum running product for a string of numbers
1259 Solvers
272 Solvers
507 Solvers
find the maximum element of the matrix
303 Solvers
Number of Even Elements in Fibonacci Sequence
697 Solvers