Competitive ProgrammingEasy

Closest Pair

Detailed guide and Python implementation for the 'Closest Pair' problem.

Problem Statement

Easy

Write a function closest_pair(arr) that takes an unsorted array of integers arr and returns a tuple of two integers (x, y) from the array that have the minimum absolute difference. The returned tuple must be sorted such that x <= y. If there are multiple pairs with the same minimum difference, return the one with the smaller x value (and if those are the same, the smaller y value).

Constraints
  • 2 <= len(arr) <= 10^5
  • -10^9 <= arr[i] <= 10^9

Examples

Example 1
Input
closest_pair([4, 9, 1, 32, 13])
Output
(1, 4)
Explanation

The difference between 1 and 4 is 3, which is the minimum difference possible between any two elements in the array.

Example 2
Input
closest_pair([12, 15, 17, 20, 25])
Output
(15, 17)
Explanation

The difference between 15 and 17 is 2, which is the minimum difference possible.

Need a Hint?
Consider using Searching & Sorting-specific data structures like sets or heaps.
Edge Cases to Watch
  • Empty input structures
  • Single element inputs
  • Large numerical bounds

Ready to Solve?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

Open in Editor

Recommended Python Resources

Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.