Minimum Operations to Reduce X to Zero

Reframing an ends-only removal problem into finding the longest middle subarray with a fixed sum, solved with an O(n) sliding window.