Max consecutive ones
Given a binary array nums and an integer k, return the maximum number of consecutive 1s you can obtain if you may flip at most k zeros to ones. Array length up to 1e5.
Implement
max_consecutive_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