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 maximum length of consecutive 1’s in it.


Input : str = '11000111101010111'
Output : 4

We have existing solution for this problem please refer Maximum consecutive one’s (or zeros) in a binary array link. We can solve this problem within single line of code in Python. Approach is very simple,

  1. Separate all sub-strings of consecutive 1’s separated by zeros using split() method of string.
  2. Print maximum length of splited sub-strings of 1’s.




# Function to find Maximum legth of consecutive 1's in a binary string
def maxConsecutive1(input):
     # input.split('0') --> splits all sub-strings of consecutive 1's
     # separated by 0's, output will be like ['11','1111','1','1','111']
     # map(len,input.split('0'))  --> map function maps len function on each 
     # sub-string of consecutive 1's
     # max() returns maximum element from a list
     print max(map(len,input.split('0')))
# Driver program
if __name__ == "__main__":
    input = '11000111101010111'




Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :
Practice Tags :


Please write to us at to report any issue with the above content.