Kth Smallest Pair Distance
Hard
Divide and Conquer
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.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.