Cody

# Problem 875. Return a list sorted by number of consecutive occurrences

Solution 1930782

Submitted on 11 Sep 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 = [1 2 2 2 3 3 7 7 93] y_correct1 = [2 3 7 1 93] ; assert(isequal(popularity_bis(x),y_correct1))

x = 1 2 2 2 3 3 7 7 93 c = 9

Index exceeds the number of array elements (9). Error in popularity_bis (line 5) while(x(i)==x(j)) Error in Test1 (line 3) assert(isequal(popularity_bis(x),y_correct1))

2   Fail
x = [1 1 2 2 2 3 3 7 7 1 93]; y_correct2 = [2 1 3 7 1 93] ; assert(isequal(popularity_bis(x),y_correct2))

c = 11

Index exceeds the number of array elements (11). Error in popularity_bis (line 5) while(x(i)==x(j)) Error in Test2 (line 3) assert(isequal(popularity_bis(x),y_correct2))

3   Fail
x = [1 0 0 2 2 -5 9 9 2 1 1 1 0 11]; y_correct1 = [1 0 2 9 -5 0 1 2 11] ; assert(isequal(popularity_bis(x),y_correct1))

c = 14

Index exceeds the number of array elements (14). Error in popularity_bis (line 5) while(x(i)==x(j)) Error in Test3 (line 3) assert(isequal(popularity_bis(x),y_correct1))

4   Fail
x = [1 0 1 1 0 0]; y_correct0 = [0 1 0 1] ; assert(isequal(popularity_bis(x),y_correct0))

c = 6

Index exceeds the number of array elements (6). Error in popularity_bis (line 5) while(x(i)==x(j)) Error in Test4 (line 3) assert(isequal(popularity_bis(x),y_correct0))

5   Fail
x = [0 1 0 0 1 1]; y_correct1 = [0 1 0 1] ; assert(isequal(popularity_bis(x),y_correct1))

c = 6

Index exceeds the number of array elements (6). Error in popularity_bis (line 5) while(x(i)==x(j)) Error in Test5 (line 3) assert(isequal(popularity_bis(x),y_correct1))