The problem of max consecutive ones is a popular **coding interview** question. Here you will be given a binary array, and you need to return the maximum number of consecutive 1s in the array. So, if you want to know how to solve this problem, this article is for you. This article will take you through how to solve the max consecutive ones problem using Python.

## Max Consecutive Ones Problem

In the max consecutive ones problem, we need to find the maximum number of consecutive 1s in a binary array. For example, look at the input and output of this problem shown below:

- Input: [1,1,0,1,1,1]| Output: 3

In the example above, there are two times we can see consecutive 1s. The first time there are 2 consecutive 1s, and the second time there are 3 consecutive 1s. Since 3 is greater, the answer is 3.

## Max Consecutive Ones using Python

I hope you have now understood what the problem of max consecutive ones means. Below is how you can solve this problem using the Python programming language:

def findMaxConsecutiveOnes(nums): max_count = 0 count = 0 for i in nums: if i == 1: count += 1 else: max_count = max(max_count, count) count = 0 return max(max_count, count) nums = [1,1,0,1,1,1] print(findMaxConsecutiveOnes(nums))

Output: 3

So this is how you can solve the max consecutive ones problem using Python. You can find many more practice questions for coding interviews solved and explained using Python **here**.

### Summary

In the max consecutive ones problem, we need to find the maximum number of consecutive 1s in a binary array. I hope you liked this article on solving the max consecutive ones problem using Python. Feel free to ask valuable questions in the comments section below.