CodingMediumcod-g564

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

Question

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

Examples

in[[1,1,1,0,0,0,1,1,1,1,0],2]out6

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.