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

In one operation, you can select any element in nums and decrease its value by $1$.

Return the minimum number of operations needed to make the sum of all elements in nums divisible by k.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

• $1 \leq$ nums[i] $\leq 1000$

• $1 \leq$ k $\leq 100$

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.