← All solutions
November 2Medium

Minimum moves to equal array elements ii

  • Array
  • Math
  • Sorting

Problem

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 or decrement an element of the array by 1.

Test cases are designed so that the answer will fit in a 32-bit integer.

Solution

class Solution:
    def minMoves2(self, nums: list[int]) -> int:
        nums.sort()
        m = nums[len(nums) // 2]
        return sum([abs(num - m) for num in nums])