Longest subsegment of 1s by changing at most k 0s
Filed under Saavn
The question
Find the length of the longest contiguous subsegment of 1s in a binary array by flipping at most k 0s.
No write-up yet. Related questions below have one.
Related Saavn questions
Collected from public candidate posts and coding forums. Updated Nov 2026.