Minimum number of moves to equal array elements – LeetCode Solution [Medium]
Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal. In one move, you can increment n – 1 elements of the array by 1.