#960Medium#16 in Yandex's list· asked at 20 companies
Max Consecutive Ones III
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: nums = [1,1,1,0,0,0,1,1,1,1,0], k = 2 Output: 6
Flip the two zeros at indices 4 and 5 (or 9 and one of the earlier ones).
Example 2
Input: nums = [0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], k = 3 Output: 10
Constraints
- •
1 <= nums.length <= 10^5 - •
nums[i]is either 0 or 1. - •
0 <= k <= nums.length