Leetcode 1658. Minimum Operations to Reduce X to Zero

Remove elements from either end to make the sum of removed elements equal x; equivalently, find the longest contiguous subarray whose sum equals total(nums) - x (so you minimize removed count) and return n - length, or -1 if no such subarray exists — solvable in O(n) with a sliding-window/hashmap approach.