# Solving Leetcode Interviews in Seconds with AI: Max Consecutive Ones


	# Introduction
	In this blog post, we will explore how to solve the LeetCode problem "485" using AI. LeetCode is a popular platform for preparing for coding interviews, and with the help of AI tools like [Chatmagic](https://www.chatmagic.app), we can generate solutions quickly and efficiently - helping you pass the interviews and get the job offer without having to study for months.

	# Problem Statement
	> Given a binary array nums, return the maximum number of consecutive 1's in the array.   Example 1:  Input: nums = [1,1,0,1,1,1] Output: 3 Explanation: The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3.  Example 2:  Input: nums = [1,0,1,1,0,1] Output: 2    Constraints:  1 <= nums.length <= 105 nums[i] is either 0 or 1.  

	# Explanation
	Here's the breakdown of the approach and the Python code:

*   **High-Level Approach:**
    *   Iterate through the `nums` array.
    *   Maintain a `current_count` to track consecutive 1s in the current sequence.
    *   Update `max_count` whenever a longer sequence of 1s is found.

*   **Complexity:**
    *   Runtime: O(n) - single pass through the array. Storage: O(1) - constant extra space.

	
	# Code
	```python
	def findMaxConsecutiveOnes(nums):
    """
    Given a binary array nums, return the maximum number of consecutive 1's in the array.
    """
    max_count = 0
    current_count = 0
    for num in nums:
        if num == 1:
            current_count += 1
            max_count = max(max_count, current_count)
        else:
            current_count = 0
    return max_count
	```