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
Problem Comments
-
9 Comments
Show
6 older comments
Jean-Marie Sainthillier
on 19 Jul 2012
Nice and useful !
Mandeep Singh
on 18 Jun 2013
good one
Thorsten Bartel
on 5 May 2017
Nice one, didn't think it was possible to do in one line initially...
Sanzhar Askaruly
on 17 Jun 2019
agree, useful
J.P.K.Varma pothuri
on 3 Jul 2019
good problem.should think to solve
Jeremy Perez
on 29 Aug 2020
nice range of solutions
Arush Sharma
on 5 Dec 2020
interesting
Addison Borger
on 30 Apr 2022
great problem
Bùi Dương
on 3 Dec 2023
pretty good question
Solution Comments
Show commentsProblem Recent Solvers6188
Suggested Problems
-
Project Euler: Problem 3, Largest prime factor
1415 Solvers
-
Back to basics 21 - Matrix replicating
1500 Solvers
-
773 Solvers
-
357 Solvers
-
Fahrenheit to Celsius converter
547 Solvers
More from this Author96
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!