Practice Minimum Moves to Equal Array Elements II
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Minimum Moves to Equal Array Elements II on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [1,2,3]
Output
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
Related LeetCode Problems
Practice more problems similar to Minimum Moves to Equal Array Elements II.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.