Programming in Python $$ Practice Problem #$1$

This practice problem focuses more on the size of arrays.

When given an integer array of size n$,$ return the minimum number of moves required to make all array elements equal. In one move, you can increment OR decrement an element of the array by $1.$

Example $1$:

Input: nums $=[1,2,3]$

Output: $2$

$($Only two moves were needed$)$

$[1,2,3]=>[2,2,3]=>[2,2,2]$

Example $2$:

Input: nums $=[1,10,2,9]$

Output: $16$

Constraints:

$$ n $==$ nums.length

$1<=$ nums.length $<=10^5$

$-10^9<=$ nums$[$i$]<=10^9$