Minimum Operations to Reduce X to Zero
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.
Example 1
Input
nums = [1,1,4,2,3], x = 5Output
2The optimal solution is to remove the last two elements to reduce x to zero.
Example 2
Input
nums = [5,6,7,8,9], x = 4Output
-1It is not possible to reduce x to exactly zero by removing elements from either end.
Constraints
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^4
- 1 <= x <= 10^9
Asked at 4 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.