ME

Closest Numbers

Problem

Given an array of distinct integers, determine the minimum absolute difference between any two elements. Print all pairs of elements with that difference, ensuring the smaller number appears first in each pair, and the pairs are sorted in ascending order.

Input

An array of distinct integers.

Output

Pairs of elements with the minimum absolute difference, sorted in ascending order.

Constraints

2 ≤ n ≤ 10^5
-10^9 ≤ numbers[i] ≤ 10^9

Example 1:

Input:[[4,2,1,3]]

Output:1 2 2 3 3 4

Example 2:

Input:[[4,-2,-1,3]]

Output:-2 -1 3 4

Constraints:

2 ≤ n ≤ 10^5
-10^9 ≤ numbers[i] ≤ 10^9

solution.cpp

Loading...

Run code to see test results

00:00 / 69:42

Closest Numbers

MediumMed•1,278 views

Problem

Given an array of distinct integers, determine the minimum absolute difference between any two elements. Print all pairs of elements with that difference, ensuring the smaller number appears first in each pair, and the pairs are sorted in ascending order.