Cody

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

Solution 1225370

Submitted on 5 Jul 2017 by Salvatore Lacava
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))

y = 0

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

v = 1 Sum = 0 y = 1

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

v = 2 Sum = 0 y = 1

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

v = 1 Sum = 0 y = 1

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

y = 0

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

v = 1 2 Sum = 0 0 y = 2

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

v = 1 2 3 4 5 6 7 8 9 10 Sum = 0 0 0 0 0 0 0 0 0 0 y = 10

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

v = 1 4 6 8 9 10 11 12 14 17 18 19 20 21 Sum = 0 1 2 3 3 3 3 3 4 5 5 5 5 5 y = 5

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

v = 2 4 6 8 10 12 14 16 18 20 22 24 26 Sum = 0 1 2 3 4 5 6 7 8 9 10 11 12 y = 1

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

v = Columns 1 through 29 2 4 6 8 9 10 14 16 17 18 22 24 25 26 30 32 37 38 39 41 42 44 53 54 58 61 67 68 69 Columns 30 through 44 73 77 78 79 81 83 85 88 89 91 92 97 98 99 100 Sum = Columns 1 through 29 0 1 2 3 3 3 4 5 5 5 6 7 7 7 8 9 10 10 10 11 11 12 13 13 14 15 16 16 16 Columns 30 through 44 17 18 18 18 19 20 21 22 22 23 23 24 24 24 24 y = 4