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
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 commentsGroup

Basics - Binary Logic
- 10 Problems
- 958 Finishers
- Find the longest sequence of 1's in a binary sequence.
- Convert given decimal number to binary number.
- Find out sum and carry of Binary adder
- Binary numbers
- Given an unsigned integer x, find the largest y by rearranging the bits in x
- Bit Reversal
- Relative ratio of "1" in binary number
- Binary code (array)
- Converting binary to decimals
- There are 10 types of people in the world
Problem Recent Solvers6361
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!