361. Binary Window with Zero Tolerance

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 to 1's. This is equivalent to finding the longest subarray containing at most k zeros.

Example:
Input: nums = [1,1,0,0,1,1], k = 1 Output: 3

Run this challenge interactively in Python or JavaScript when the app loads.