Got crushed by the question asked in recent interview

given a binary array containing 0s and 1s. You can flip the bits at most k times. Return maximum sum of the length of subarrays. where each subarray is an array of only 1s and has length greater than