LeetCode Entry

462. Minimum Moves to Equal Array Elements II

02.11.2026 medium 2026 kotlin rust

Min +1-1 to make all equal

462. Minimum Moves to Equal Array Elements II medium substack youtube

https://dmitrysamoylenko.com/leetcode/

Join me on Telegram

https://t.me/leetcode_daily_unstoppable/1530

Problem TLDR

Min +1-1 to make all equal

Intuition

Median is the optimal baseline

Approach

• quickselect would make it O(n)

Complexity

• Time complexity: \(O(nlogn)\)

• Space complexity: \(O(1)\)

Code

    fun minMoves2(n: IntArray) =
        n.run{sort();sumOf{abs(it-n[size/2])}}

    pub fn min_moves2(mut n: Vec<i32>) -> i32 {
        n.sort(); n.iter().map(|x| (x - n[n.len()/2]).abs()).sum()
    }