Description
Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements.
Return a list of pairs in ascending order(with respect to pairs), each pair [a, b] follows
a, bare fromarra < bb - aequals to the minimum absolute difference of any two elements inarr
Example 1:
Input: arr = [4,2,1,3] Output: [[1,2],[2,3],[3,4]] Explanation: The minimum absolute difference is 1. List all pairs with difference equal to 1 in ascending order.
Example 2:
Input: arr = [1,3,6,10,15] Output: [[1,3]]
Example 3:
Input: arr = [3,8,-10,23,19,-4,-14,27] Output: [[-14,-10],[19,23],[23,27]]
Constraints:
2 <= arr.length <= 105-106 <= arr[i] <= 106
Solutions
This solution sorts the array and then in a single efficient pass tracks the minimum difference encountered while simultaneously building the result list, updating both the minimum and result whenever a smaller difference is found or the current difference equals the known minimum.
Language: javascript(2026-01-26 08:51)DONE
CPU Performance79.71%
Memory Performance34.06%
/**
* @param {number[]} arr
* @return {number[][]}
*/
var minimumAbsDifference = function(arr) {
arr.sort((a, b) => a - b);
let min = Infinity;
let res = [];
for (let i = 1; i < arr.length; i++) {
const diff = arr[i] - arr[i - 1];
if (diff < min) {
min = diff;
res = [[arr[i - 1], arr[i]]];
} else if (diff === min) {
res.push([arr[i - 1], arr[i]]);
}
}
return res;
};