Cody

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

Solution 242290

Submitted on 10 May 2013 by Abhijit Badve
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))

start_idx = [] end_idx = []

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

start_idx = 1 end_idx = 1

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

start_idx = 2 end_idx = 2

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

start_idx = 1 end_idx = 1

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

start_idx = [] end_idx = []

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

start_idx = 1 end_idx = 2

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

start_idx = 1 end_idx = 10

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

start_idx = 1 4 6 8 14 17 end_idx = 1 4 6 12 14 21

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

start_idx = 2 4 6 8 10 12 14 16 18 20 22 24 26 end_idx = 2 4 6 8 10 12 14 16 18 20 22 24 26

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

start_idx = Columns 1 through 16 2 4 6 8 14 16 22 24 30 32 37 41 44 53 58 61 Columns 17 through 25 67 73 77 81 83 85 88 91 97 end_idx = Columns 1 through 16 2 4 6 10 14 18 22 26 30 32 39 42 44 54 58 61 Columns 17 through 25 69 73 79 81 83 85 89 92 100

Suggested Problems

More from this Author95

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!