Leetcode 453. Minimum Moves to Equal Array Elements
Given an array where each move increments n−1 elements by 1 (equivalently decrementing a single element), compute the minimum moves to equalize all elements — which equals sum(nums) − n * min(nums), achievable in O(n) time.
Asked at:
Amazon
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Late June, 2026
Amazon
Mid-level
Mid February, 2025
Amazon
Mid-level
Given a sorted integer array arr, two integers k and x, return the k closest integers to x in the array. The result should also be sorted in ascending order. An integer a is closer to x than an integer b if: |a - x| < |b - x|, or |a - x| == |b - x| and a < b Example 1: Input: arr = [1,2,3,4,5], k = 4, x = 3 Output: [1,2,3,4] Example 2: Input: arr = [1,1,2,3,4,5], k = 4, x = -1 Output: [1,1,2,3] Constraints: 1 <= k <= arr.length 1 <= arr.length <= 104 arr is sorted in ascending order. -104 <= arr[i], x <= 104
Hello Interview Premium
Your account is free and you can post anonymously if you choose.