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 2 3 4 3 2 1 2];
n = 2;
y_correct = 3;
assert(isequal(countN(x,n),y_correct))
|
2 | Pass |
x = [1 2 3 4 3 2 1 2];
n = 4;
y_correct = 1;
assert(isequal(countN(x,n),y_correct))
|
3 | Pass |
x = [1 2 3 4 3 2 1 2];
n = 1;
y_correct = 2;
assert(isequal(countN(x,n),y_correct))
|
265 Solvers
205 Solvers
304 Solvers
403 Solvers
90 Solvers