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
Solve

Solution Stats

39.6% Correct | 60.4% Incorrect
Last Solution submitted on Jul 12, 2025

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers6471

Suggested Problems

More from this Author96

Problem Tags

diff regexp strings

Community Treasure Hunt

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

Start Hunting!