Longest ones after flipping zeros
Given a binary array nums and an integer k, you may flip at most k of the 0s to 1s. Return the length of the longest contiguous subarray that contains only 1s after performing at most k flips. Here 1 <= len(nums) <= 10^5 and 0 <= k <= len(nums).
Implement
longest_ones(nums: list[int], k: int) → intExamples
in
[[1,1,1,0,0,0,1,1,1,1,0],2]out6What 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,1,0,0,0,1,1,1,1,0],2]6not run yetsample