Hackerrank - Closest Numbers Solution

# Hackerrank - Closest Numbers Solution

Sorting is useful as the first step in many different tasks. The most common task is to make finding things easier, but there are other uses as well. In this case, it will make it easier to determine which pair or pairs of elements have the smallest absolute difference between them.

For example, if you've got the list , sort it as  to see that several pairs have the minimum difference of : . The return array would be .

Given a list of unsorted integers, , find the pair of elements that have the smallest absolute difference between them. If there are multiple pairs, find them all.

Function Description

Complete the closestNumbers function in the editor below. It must return an array of integers as described.

closestNumbers has the following parameter(s):

• arr: an array of integers

Input Format

The first line contains a single integer , the length of .
The second line contains  space-separated integers, .

Constraints

• All  are unique in .

Output Format

Output the pairs of elements with the smallest difference. If there are multiple pairs, output all of them in ascending order, all on the same line with just a single space between each pair of numbers. A number may be part of two pairs when paired with its predecessor and its successor.

Sample Input 0

10
-20 -3916237 -357920 -3620601 7374819 -7330761 30 6246457 -6461594 266854


Sample Output 0

-20 30


Explanation 0
(30) - (-20) = 50, which is the smallest difference.

Sample Input 1

12
-20 -3916237 -357920 -3620601 7374819 -7330761 30 6246457 -6461594 266854 -520 -470


Sample Output 1

-520 -470 -20 30


Explanation 1
(-470) - (-520) = 30 - (-20) = 50, which is the smallest difference.

Sample Input 2

4
5 4 3 2


Sample Output 2

2 3 3 4 4 5


Explanation 2
Here, the minimum difference will be 1. Valid pairs are (2, 3), (3, 4), and (4, 5). We print the elements of each pair, space-separated on a single line.

### Solution in Python

def closestNumbers(arr):
arr.sort()
min_dif = abs(arr[0]-arr[1])
ans = []
for i in range(len(arr)-1):
d = abs(arr[i]-arr[i+1])
if d==min_dif:
ans += [arr[i], arr[i+1]]
min_dif =d
elif d<min_dif:
ans = [arr[i], arr[i+1]]
min_dif =d
return ans

input()
print(*closestNumbers(list(map(int,input().split()))))


## Enjoying these posts? Subscribe for more

That's okay. But without advertising-income, we can't keep making this site awesome.

We don't have any banner, Flash, animation, obnoxious sound, or popup ad. We do not implement these annoying types of ads!

We need money to operate the site, and almost all of it comes from our online advertising.