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

32.98% Correct | 67.02% Incorrect
Last solution submitted on Mar 21, 2019

Problem Comments

Solution Comments

Recent Solvers2135

Suggested Problems

More from this Author95

Discover MakerZone

MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn more

Discover what MATLAB® can do for your career.

Opportunities for recent engineering grads.

Apply Today

MATLAB Academy

New to MATLAB?

Learn MATLAB today!