Maximize 1s by flipping at most one subarray
Filed under Early-Stage Startup
The question
Given a binary array, flip at most one subarray (changing 0s to 1s and 1s to 0s) to maximize the total number of 1s.
No write-up yet. Related questions below have one.
Collected from public candidate posts and coding forums. Updated Nov 2026.