Longest ones after flips
Given a binary array a (values 0 or 1) and an integer k, return the length of the longest contiguous subarray containing only 1s after flipping at most k zeros to ones. k is non-negative; the array may be all zeros.
Implement
longest_ones_k_flips(a: list[int], k: int) → intExamples
in
[[1,1,0,0,1,1,1,0,1],2]out7What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 20 min
solution.py
InputExpectedGot
[[1,1,0,0,1,1,1,0,1],2]7not run yetsample