Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

Kth Smallest Pair Distance

The distance of a pair (i, j) with i < j is |nums[i] - nums[j]|. Print the k-th smallest distance among all pairs.

Constraints

2 <= n <= 10^4 0 <= nums[i] <= 10^6 1 <= k <= n * (n - 1) / 2

Discussion

No discussions yet.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.