Cody

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

Solution 2023322

Submitted on 15 Nov 2019 at 16:05
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   Fail
x = '0'; y_correct = 0; assert(isequal(lengthOnes(x),y_correct))

y = '0'

Assertion failed.
2   Fail
x = '1'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))

y = '1'

Assertion failed.
3   Fail
x = '01'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))

y = '01'

Assertion failed.
4   Fail
x = '10'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))

y = '10'

Assertion failed.
5   Fail
x = '00'; y_correct = 0; assert(isequal(lengthOnes(x),y_correct))

y = '00'

Assertion failed.
6   Fail
x = '11'; y_correct = 2; assert(isequal(lengthOnes(x),y_correct))

y = '11'

Assertion failed.
7   Fail
x = '1111111111'; y_correct = 10; assert(isequal(lengthOnes(x),y_correct))

y = '1111111111'

Assertion failed.
8   Fail
x = '100101011111010011111'; y_correct = 5; assert(isequal(lengthOnes(x),y_correct))

y = '100101011111010011111'

Assertion failed.
9   Fail
x = '01010101010101010101010101'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))

y = '01010101010101010101010101'

Assertion failed.
10   Fail
x = '0101010111000101110001011100010100001110110100000000110001001000001110001000111010101001101100001111'; y_correct = 4; assert(isequal(lengthOnes(x),y_correct))

y = '0101010111000101110001011100010100001110110100000000110001001000001110001000111010101001101100001111'

Assertion failed.

Suggested Problems

More from this Author95