345. Minimum Operations to Reduce X to Zero
MediumSliding Window
You are given an integer array nums and an integer x. In one operation, you can either remove the leftmost or the rightmost element from the array nums and subtract its value from x. Note that this modifies the array for future operations. Return the minimum number of operations to reduce x to exactly 0 if it is possible, otherwise, return -1.
Examples
Input: [1,1,4,2,3] 5
Output: 2
Explanation: total=11, target=11-5=6. Longest middle block summing to 6 is [1,1,4] (length 3), so answer = 5 - 3 = 2 (remove the last two elements 2 and 3).
Constraints
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^4
- 1 <= x <= 10^9
Loading...
Run checks all cases above. Submit evaluates all test cases.