Find K-th Smallest Pair Distance - Solution & Explanation

This approach utilizes sorting and a min-heap (or priority queue) to efficiently manage and retrieve the k-th smallest distance. The key steps are:

1. Sort the array nums. This simplifies the process of finding the distances as all distance calculations will involve consecutive elements.
2. Use a priority queue to dynamically manage the smallest pair distances.
3. Iterate through the array to compare all pairs, compute their distances, and manage the dynamic pool of smallest distances using the min-heap.
4. Finally, extract the k-th smallest distance from the min-heap.

First, the array is sorted to enable orderly distance calculations. A min-heap (priority queue) is used to efficiently manage the distances and extract the k-th smallest. After computing and storing distances in the heap, we extract the smallest k elements, finally returning the k-th one.

This more efficient approach combines binary search with a two-pointer technique. The principal idea is to use binary search over distance values to pinpoint the k-th smallest distance. It involves:

1. Sorting the array nums.
2. Using binary search for the smallest distance, verifying with two pointers how many distances are less than a given middle, adjusting search space based on the count.
3. The two-pointer method efficiently counts how many distances are smaller than the middle of the binary search range at each step.

This solution involves a binary search to determine the smallest possible distance. The associated helper function utilizes a two-pointer technique to count how many pairs have distances less than a proposed distance during the search process. Adjusting the binary search bounds based on this count homes in on the k-th smallest.