Max Consecutive Ones III

You are given a binary array nums and an integer k, return the maximum number of consecutive 1's in the array if you can flip at most k 0's.

Example 1:

Input: nums = [1,1,1,0,0,0,1,1,1,1,0], k = 2

Output: 6

Explanation: The subarray from indices 5 to 10 has 2 zeroes and we can flip them.

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 <= 100,000
• nums[i] is either 0 or 1.
• 0 <= k <= nums.length

Company Tags

Please upgrade to NeetCode Pro to view company tags.