You are given an integer array nums. In one operation, you can add $1$ to or subtract $1$ from any element of nums.

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

Constraints:

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

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

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.