Max Consecutive Ones III

Given a binary array nums and an integer k, return the longest subarray of 1s possible if you can flip at most k zeroes to 1s.

Example

Input: 1 1 1 0 0 0 1 1 1 1 0, k = 2 Output: 6

Approach

Sliding window that tracks the count of zeroes inside it. Expand right freely; when the zero count exceeds k, shrink from the left until it's back within budget. Track the max window size seen.

Input format

Line 1: the array, space-separated Line 2: k