Cody

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

Solution 1395026

Submitted on 27 Dec 2017 by Kodavati Mahendra
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
x = '0'; y_correct = 0; assert(isequal(lengthOnes(x),y_correct))

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

y = [] ans = 1
3   Pass
x = '01'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))

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

y = 2 ans = 1
5   Pass
x = '00'; y_correct = 0; assert(isequal(lengthOnes(x),y_correct))

y = 1 2 ans = 0
6   Pass
x = '11'; y_correct = 2; assert(isequal(lengthOnes(x),y_correct))

y = 1×0 empty double row vector ans = 2
7   Pass
x = '1111111111'; y_correct = 10; assert(isequal(lengthOnes(x),y_correct))

y = 1×0 empty double row vector ans = 10
8   Pass
x = '100101011111010011111'; y_correct = 5; assert(isequal(lengthOnes(x),y_correct))

y = 2 3 5 7 13 15 16 ans = 5
9   Pass
x = '01010101010101010101010101'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))

y = 1 3 5 7 9 11 13 15 17 19 21 23 25 ans = 1
10   Pass
x = '0101010111000101110001011100010100001110110100000000110001001000001110001000111010101001101100001111'; y_correct = 4; assert(isequal(lengthOnes(x),y_correct))

y = Columns 1 through 29 1 3 5 7 11 12 13 15 19 20 21 23 27 28 29 31 33 34 35 36 40 43 45 46 47 48 49 50 51 Columns 30 through 56 52 55 56 57 59 60 62 63 64 65 66 70 71 72 74 75 76 80 82 84 86 87 90 93 94 95 96 ans = 4

Suggested Problems

More from this Author95