Available question text
Given a binary array, find the maximum length of a contiguous subarray of 1s you can get by flipping at most one 0 to 1; this is typically solved with a sliding-window/two-pointer approach that maintains a window containing at most one zero.
Related questions
Continue with questions that share topics or the same question type.
- Max Consecutive Ones
Coding · Array
- Max Consecutive Ones III
Coding · Array · Binary Search · Prefix Sum
- Minimum Adjacent Swaps for K Consecutive Ones
Coding
- Non-negative Integers without Consecutive Ones
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 2 records
Bloomberg
Leetcode 487. Max Consecutive Ones II
Reported Feb 27, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceSnapchat
Leetcode 487. Max Consecutive Ones II
Reported Oct 31, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source