Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal.

In a single move, you can increment or decrement an element of the array by $1$.

Constraints:

• n == nums.length

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

• $-10^9 \leq$ nums[i] $\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.