Cody

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

Created by Cody Team in Community

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

33.19% Correct | 66.81% Incorrect
Last solution submitted on May 21, 2019

Problem Comments

Solution Comments

Recent Solvers2205

Suggested Problems

More from this Author95