Cody

# Problem 15. Find the longest sequence of 1's in a binary sequence.

Solution 1750503

Submitted on 14 Mar 2019 by Samatha Aleti
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 = '0'; y_correct = 0; assert(isequal(lengthOnes(x),y_correct))

2   Pass
x = '1'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))

c = 1 y = 1

3   Pass
x = '01'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))

c = 1 y = 1

4   Pass
x = '10'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))

c = 1 y = 1

5   Pass
x = '00'; y_correct = 0; assert(isequal(lengthOnes(x),y_correct))

6   Pass
x = '11'; y_correct = 2; assert(isequal(lengthOnes(x),y_correct))

c = 1 y = 1 c = 2 y = 2

7   Pass
x = '1111111111'; y_correct = 10; assert(isequal(lengthOnes(x),y_correct))

c = 1 y = 1 c = 2 y = 2 c = 3 y = 3 c = 4 y = 4 c = 5 y = 5 c = 6 y = 6 c = 7 y = 7 c = 8 y = 8 c = 9 y = 9 c = 10 y = 10

8   Pass
x = '100101011111010011111'; y_correct = 5; assert(isequal(lengthOnes(x),y_correct))

c = 1 y = 1 c = 1 c = 1 c = 1 c = 2 y = 2 c = 3 y = 3 c = 4 y = 4 c = 5 y = 5 c = 1 c = 1 c = 2 c = 3 c = 4 c = 5

9   Pass
x = '01010101010101010101010101'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))

c = 1 y = 1 c = 1 c = 1 c = 1 c = 1 c = 1 c = 1 c = 1 c = 1 c = 1 c = 1 c = 1 c = 1

10   Pass
x = '0101010111000101110001011100010100001110110100000000110001001000001110001000111010101001101100001111'; y_correct = 4; assert(isequal(lengthOnes(x),y_correct))

c = 1 y = 1 c = 1 c = 1 c = 1 c = 2 y = 2 c = 3 y = 3 c = 1 c = 1 c = 2 c = 3 c = 1 c = 1 c = 2 c = 3 c = 1 c = 1 c = 1 c = 2 c = 3 c = 1 c = 2 c = 1 c = 1 c = 2 c = 1 c = 1 c = 1 c = 2 c = 3 c = 1 c = 1 c = 2 c = 3 c = 1 c = 1 c = 1 c = 1 c = 2 c = 1 c = 2 c = 1 c = 2 c = 3 c = 4 y = 4