Cody

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

Given a string such as

 s = '011110010000000100010111'

find the length of the longest string of consecutive 1's. In this example, the answer would be 4.

Example:

 Input  x = '110100111'
 Output y is 3

Solution Stats

32.69% Correct | 67.31% Incorrect
Last Solution submitted on Nov 14, 2019

Problem Comments

Solution Comments

Problem Recent Solvers2415

Suggested Problems

More from this Author95

Problem Tags