Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [5 5 2 1 1 1 1 3];
correct = [2 5 1 2 4 1 1 3];
assert(isequal(correct, CountSeq(x)));
|
2 | Pass |
x = [9];
correct = [1 9];
assert(isequal(correct, CountSeq(x)));
|
3 | Pass |
x = ones(1,9);
correct = [9 1];
assert(isequal(correct, CountSeq(x)));
|
4 | Pass |
x = 1:9;
correct = [1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9];
assert(isequal(correct, CountSeq(x)));
|
5 | Pass |
x = [1 2 2 1];
correct = [1 1 2 2 1 1];
assert(isequal(correct, CountSeq(x)));
|
Sum of first n terms of a harmonic progression
257 Solvers
232 Solvers
Create an n-by-n null matrix and fill with ones certain positions
270 Solvers
Simple equation: Annual salary
3779 Solvers
2338 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!