You are given an integer array nums and an integer k.

For each index i where $0 \leq i <$ nums.length, you must update nums[i] to either nums[i] $+$ k or nums[i] $-$ k.

The score of nums is the difference between the maximum element and the minimum element of nums.

Return the minimum possible score of nums after modifying every element.

Constraints:

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

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

• $0 \leq$ k $\leq 10^4$

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.