Search⌘ K
AI Features

Solution: Find K-th Smallest Pair Distance

Explore how to determine the kth smallest distance between pairs in an array by combining sorting, binary search, and sliding window methods. This lesson helps understand the problem-solving approach and optimization techniques to efficiently compute pair distances within given constraints.

Statement

Given an array of integers nums and an integer k, return the kthk^{th} smallest distance between any pair of integers (nums[i], nums[j]), where 00 \leq i << j << num.length.

The distance between a pair of integers, aa and bb, is defined as the absolute difference between them.

Constraints:

  • n==n == nums.length

  • 2n1032 \leq n \leq 10^3

  • 00 \leq nums[i] ...