Max Consecutive Ones III

Asked in the Screening stage.

Given a binary array nums and an integer k, implement longest_ones(nums, k) to return the maximum length of a contiguous subarray containing at most k zeroes. Treat those zeroes as flipped to ones.

Input and Output

nums is an array of integers containing only 0 and 1. k is a non-negative integer. Return an integer representing the maximum achievable length.

Constraints

1 <= nums.length <= 1000
0 <= k <= nums.length
nums[i] is either 0 or 1

Function Signature

def longest_ones(nums, k):

Your question is Max Consecutive Ones III. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem