Cody

Problem 55. Counting Sequence

Solution 1909911

Submitted on 23 Aug 2019
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   Fail
x = [5 5 2 1 1 1 1 3]; correct = [2 5 1 2 4 1 1 3]; assert(isequal(correct, CountSeq(x)));

y = [] d = 1×9 logical array 1 0 1 1 0 0 0 1 1 n = 2 1 4 1 y = 2 5 y = 2 5 1 5 y = 2 5 1 5 4 1 y = 2 5 1 5 4 1 1 5

Assertion failed.

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

y = [] d = 1×2 logical array 1 1 n = 1 y = 1 9

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

y = [] d = 1×10 logical array 1 0 0 0 0 0 0 0 0 1 n = 9 y = 9 1

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

y = [] d = 1×10 logical array 1 1 1 1 1 1 1 1 1 1 n = 1 1 1 1 1 1 1 1 1 y = 1 1 y = 1 1 1 1 y = 1 1 1 1 1 1 y = 1 1 1 1 1 1 1 1 y = 1 1 1 1 1 1 1 1 1 1 y = 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 y = 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

Assertion failed.

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

y = [] d = 1×5 logical array 1 1 0 1 1 n = 1 2 1 y = 1 1 y = 1 1 2 2 y = 1 1 2 2 1 1