Leetcode 487. Max Consecutive Ones II

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.