Maximum length of consecutive 1’s in a binary string in Python using Map function
We are given a binary string containing 1’s and 0’s. Find the maximum length of consecutive 1’s in it.
Input : str = '11000111101010111' Output : 4
We have an existing solution for this problem please refer to Maximum consecutive one’s (or zeros) in a binary array link. We can solve this problem within single line of code in Python. The approach is very simple,
- Separate all sub-strings of consecutive 1’s separated by zeros using split() method of string.
- Print maximum length of split sub-strings of 1’s.
Time complexity : O(n)
Auxiliary Space : O(1)