[Sliding Window] Max Consecutive Ones III

[sudosf]

Problem

Given a binary array and integer k, return the maximum number of consecutive 1s if you can flip at most k zeros.

References

• LeetCode: https://leetcode.com/problems/max-consecutive-ones-iii/description/
• GFG: https://www.geeksforgeeks.org/problems/maximize-number-of-1s0905/1
• Sheet: https://www.risingbrain.org/sheet#array (Sliding Window Pattern: Two Pointers (Arrays) #3)
• Parent: Pattern: Sliding Window (Arrays) #10

Difficulty

🟡 Medium

Companies

Amazon, Google, Microsoft

Notes

Language: Java
Variable window. Track zeros flipped. Shrink left when zeros flipped exceeds k.