Practice Tesla Coding Question | Real Coding Interviews | Hack2hire

NewML System Design & SQL tracks just landedSee what's new

Question Bank Pricing Blog Forum

Quick Summary

Identify all pairs in an integer array that share the smallest absolute difference.
Each pair must be formatted as [smaller, larger] and the final result sorted by the first element.
The algorithm must handle arrays up to 10^5 efficiently without using a brute-force O(N^2) approach.

What This Tests

Array sorting and ordering properties
Time complexity optimization over naive pairwise checks
Adjacent element traversal and comparison
Output formatting and constraint handling

Common Patterns

Sorting

Test Cases

Input

Output

Expected