Cody

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

Solution 2761258

Submitted on 30 Jul 2020
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   Fail
x = '0'; y_correct = 0; assert(isequal(lengthOnes(x),y_correct))

count = 1

Output argument "y" (and maybe others) not assigned during call to "lengthOnes". Error in Test1 (line 3) assert(isequal(lengthOnes(x),y_correct))

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

count = 1

Output argument "y" (and maybe others) not assigned during call to "lengthOnes". Error in Test2 (line 3) assert(isequal(lengthOnes(x),y_correct))

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

count = 1 1 count = 1 0 y = 1

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

count = 1 1 count = 1 0 y = 1

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

count = 1 1 count = 1 0 y = 1

Assertion failed.

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

count = 1 1 count = 1 0 y = 1

Assertion failed.

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

count = 1 1 1 1 1 1 1 1 1 1 count = 1 0 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 y = 1

Assertion failed.

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

count = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 count = 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 y = 1

Assertion failed.

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

count = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 count = 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 y = 1 count = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 y = 1

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

count = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 61 through 90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 91 through 100 1 1 1 1 1 1 1 1 1 1 count = Columns 1 through 30 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 61 through 90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 91 through 100 1 1 1 1 1 1 1 1 1 1 y = 1 count = Columns 1 through 30 1 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 61 through 90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 91 through 100 1 1 1 1 1 1 1 1 1 1 y = 1 count = Columns 1 through 30 1 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 61 through 90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 91 through 100 1 1 1 1 1 1 1 1 1 1 y = 1 count = Columns 1 through 30 1 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 61 through 90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 91 through 100 1 1 1 1 1 1 1 1 1 1 y = 1 count = Columns 1 through 30 1 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 61 through 90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 91 through 100 1 1 1 1 1 1 1 1 1 1 y = 1 count = Columns 1 through 30 1 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 61 through 90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 91 through 100 1 1 1 1 1 1 1 1 1 1 y = 1 count = Columns 1 through 30 1 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 61 through 90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 91 through 100 1 1 1 1 1 1 1 1 1 1 y = 1 count = Columns 1 through 30 1 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 61 through 90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 91 through 100 1 1 1 1 1 1 1 1 1 1 y = 1 count = Columns 1 through 30 1 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 61 through 90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 91 through 100 1 1 1 1 1 1 1 1 1 1 y = 1 count = Columns 1 through 30 1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 61 through 90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 91 through 100 1 1 1 1 1 1 1 1 1 1 y = 1 count = Columns 1 through 30 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 61 through 90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 91 through 100 1 1 1 1 1 1 1 1 1 1 y = 1 count = Columns 1 through 30 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 61 through 90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 91 through 100 1 1 1 1 1 1 1 1 1 1 y = 1 count = Columns 1 through 30 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 61 through 90 1 1 1 1 1 1 1 1 ...

Assertion failed.