CodingMediumcod-g094

Subject Sliding windowLevel Mid–Senior~20 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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) → int

Examples

in[[1,1,0,0,1,1,1,0,1],2]out7

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.