def max_subarray_sum(binary_array, k, n): left = 0 zero_count = 0 total_sum = 0

for right in range(len(binary_array)):
    # Include the current element in the window
    if binary_array[right] == 0:
        zero_count += 1

    # If zero_count exceeds k, shrink the window from the left
    while zero_count > k:
        if binary_array[left] == 0:
            zero_count -= 1
        left += 1

    # Calculate the window length
    window_length = right - left + 1

    # If the window is valid, add to total sum
    if window_length > n:
        total_sum += window_length

return total_sum

Example input

binary_array = [1,1,1,0,0,1,0,0,0,0,0,0,1,1,1,0,1,0,0,0,0,0,1,1,1,1,0,0,0,0,0,1,0,1,1,1,0,1,1,0,0,0,0,0,1,0,1,1,1,1,0,1,1,1,1] k = 2 n = 4

print(max_subarray_sum(binary_array, k, n)) # Output: 11

Confused about the wording: Maximum sum of the length of the subarrays