You are given an integer array nums and an integer x. In each operation, you can remove either the leftmost or the rightmost element from the array nums and subtract its value from x. This removes the element from the array for any subsequent operations.

Return the minimum number of operations required to reduce x to exactly $0$. If it is impossible to reduce x to $0$, return $-1$.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^4$

• $1 \leq$ x $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.