Cody

# Problem 55. Counting Sequence

Solution 2035830

Submitted on 26 Nov 2019 by Asif Newaz
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

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)));

a = 8 y = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 2 5 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 2 5 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 2 5 1 2 1 1 1 1 1 1 1 1 1 1 1 1 j = 3 y = 2 5 1 2 1 1 1 1 1 1 1 1 1 1 1 1 y = 2 5 1 2 1 1 1 1 1 1 1 1 1 1 1 1 j = 5 y = 2 5 1 2 2 1 1 1 1 1 1 1 1 1 1 1 y = 2 5 1 2 2 1 1 1 1 1 1 1 1 1 1 1 y = 2 5 1 2 3 1 1 1 1 1 1 1 1 1 1 1 y = 2 5 1 2 3 1 1 1 1 1 1 1 1 1 1 1 y = 2 5 1 2 4 1 1 1 1 1 1 1 1 1 1 1 y = 2 5 1 2 4 1 1 1 1 1 1 1 1 1 1 1 y = 2 5 1 2 4 1 1 1 1 1 1 1 1 1 1 1 y = 2 5 1 2 4 1 1 3 1 1 1 1 1 1 1 1 j = 7 y = 2 5 1 2 4 1 1 3

2   Pass
x = [9]; correct = [1 9]; assert(isequal(correct, CountSeq(x)));

a = 1 y = 1 1 y = 1 1 y = 1 1 y = 1 9

3   Pass
x = ones(1,9); correct = [9 1]; assert(isequal(correct, CountSeq(x)));

a = 9 y = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 5 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 5 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 6 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 6 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 7 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 7 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 8 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 8 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 9 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 9 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 9 1

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)));

a = 9 y = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 j = 3 y = 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 1 1 2 1 3 1 1 1 1 1 1 1 1 1 1 1 1 j = 5 y = 1 1 1 2 1 3 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 1 1 2 1 3 1 4 1 1 1 1 1 1 1 1 1 1 j = 7 y = 1 1 1 2 1 3 1 4 1 1 1 1 1 1 1 1 1 1 y = 1 1 1 2 1 3 1 4 1 5 1 1 1 1 1 1 1 1 j = 9 y = 1 1 1 2 1 3 1 4 1 5 1 1 1 1 1 1 1 1 y = 1 1 1 2 1 3 1 4 1 5 1 6 1 1 1 1 1 1 j = 11 y = 1 1 1 2 1 3 1 4 1 5 1 6 1 1 1 1 1 1 y = 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 1 1 1 j = 13 y = 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 1 1 1 y = 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 1 j = 15 y = 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 1 y = 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 j = 17 y = 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9

5   Pass
x = [1 2 2 1]; correct = [1 1 2 2 1 1]; assert(isequal(correct, CountSeq(x)));

a = 4 y = 1 1 1 1 1 1 1 1 y = 1 1 1 1 1 1 1 1 y = 1 1 1 2 1 1 1 1 j = 3 y = 1 1 2 2 1 1 1 1 y = 1 1 2 2 1 1 1 1 y = 1 1 2 2 1 1 1 1 y = 1 1 2 2 1 1 1 1 j = 5 y = 1 1 2 2 1 1

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!