Practice Max Consecutive Ones
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given a binary array nums, return the maximum number of consecutive 1's in the array.
Source: Max Consecutive Ones on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [1,1,0,1,1,1]
Output
3
# Example 2
Input
nums = [1,0,1,1,0,1]
Output
2
Constraints
1 <= nums.length <= 10^5
nums[i] is either 0 or 1.
Related LeetCode Problems
Practice more problems similar to Max Consecutive Ones.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.