Leetcode•Apr 21, 2026

Minimum Moves to Equal Array Elements II

Hazrat Ali

Leetcode

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.

 

Example 1:

Input: nums = [1,2,3]
Output: 2
Explanation:
Only two moves are needed (remember each move increments or decrements one element):
[1,2,3]  =>  [2,2,3]  =>  [2,2,2]

Example 2:

Input: nums = [1,10,2,9]
Output: 16

Solution
var minMoves2 = function(nums) {
    nums.sort((a, b) => a - b);

    let n = nums.length;
    let median = nums[Math.floor(n / 2)];

    let moves = 0;
    for (let num of nums) {
        moves += Math.abs(num - median);
    }

    return moves;
};



Comments