You are given an integer array nums and two integers limit and goal. The array nums has an initial sum that you want to adjust so that the sum of all elements becomes equal to goal.

To achieve this, you can append elements to the array where each appended element $x$ must satisfy $|x| \leq$ limit.

Return the minimum number of elements you need to append so that the sum of the array equals goal.

Constraints:

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

• $1 \leq$ limit $\leq 10^6$

• $-$limit $\leq$ nums[i] $\leq$ limit

• $-10^9 \leq$ goal $\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.