Max Consecutive Ones III — Medium Coding Interview Question

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

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

Output: 6

Explanation: [1,1,1,0,0,1,1,1,1,1,1]

Constraints

• 1 ≤ nums.length ≤ 10⁵
• nums[i] is 0 or 1
• 0 ≤ k ≤ nums.length

Topics & Companies

Topics: sliding-window, arrays

Asked by: Amazon, Google, Meta, Microsoft

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns