Cody

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

Solution 1796414

Submitted on 24 Apr 2019 by Patrick Tindell
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))

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

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

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

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

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

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

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

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

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

x = '001010101110001011100010111000101000011101101000000001100010010000011100010001110101010011011000011110'

Suggested Problems

More from this Author95