Cody

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

Solution 1978002

Submitted on 15 Oct 2019 by Joseph Chambers
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))

idx = 1 2 3 le = 3 a = 0 0 y = 0

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

idx = 1 3 le = 2 a = 1 y = 1

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

idx = 1 2 4 le = 3 a = 0 1 y = 1

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

idx = 1 3 4 le = 3 a = 1 0 y = 1

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

idx = 1 2 3 4 le = 4 a = 0 0 0 y = 0

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

idx = 1 4 le = 2 a = 2 y = 2

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

idx = 1 12 le = 2 a = 10 y = 10

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

idx = 1 3 4 6 8 14 16 17 23 le = 9 a = 1 0 1 1 5 1 0 5 y = 5

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

idx = 1 2 4 6 8 10 12 14 16 18 20 22 24 26 28 le = 15 a = 0 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1

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

idx = Columns 1 through 30 1 2 4 6 8 12 13 14 16 20 21 22 24 28 29 30 32 34 35 36 37 41 44 46 47 48 49 50 51 52 Columns 31 through 58 53 56 57 58 60 61 63 64 65 66 67 71 72 73 75 76 77 81 83 85 87 88 91 94 95 96 97 102 le = 58 a = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 57 2 0 0 1 0 1 0 0 0 0 3 0 0 1 0 0 3 1 1 1 0 2 2 0 0 0 4 y = 4