Arrays · Coding problem
Max Consecutive Ones
A free coding problem from the Single-Pass State Tracking skill. Read it here, then solve it in the app in Java or Python.
- Easy
- Coding problem
- Free
- Java and Python
The problem
nums contains only 0s and 1s. Return the length of the longest unbroken run of 1s.
Example
Input: nums = [1, 0, 1, 1, 1, 1, 0, 0, 1, 1]
Output: 4
Constraints
1 <= nums.length <= 2 * 10^5nums[i]is0or1
How it's graded
- Run checks your code against the examples. Submit also runs a hidden suite in four groups - basic cases, edge cases, random inputs and performance tests at the size limit - and shows which groups pass, never the hidden inputs.
- Stuck? Hints come in four steps, from a nudge to a code skeleton, each costing part of the points.
- Once you pass, you see the approaches from brute force to optimal, and where your solution lands among them.
More problems in Single-Pass State Tracking
Solve it Max Consecutive Ones free
No card needed. Lessons, practice questions and easy problems are free forever.
Free plan, no card · 7-day Pro trial · Cancel anytime