Live Batches
Masterclasses
Menu
Free Courses
Account
Login / Sign Up
Problem Submissions Solution

Kth Smallest Pair Distance

Difficulty: Medium

Acceptance: 65.00%

Points: 30.00

You are given an integer array nums[]. The distance between a pair of elements is defined as the absolute difference between their values. Your task is to find the kth smallest distance among all possible pairs in the array.

Topics

Companies

Articles

Examples:

N/A

Constraints:
  • 2 = nums.length = 104
  • 0 = nums[i] = 106
  • 1 = k = nums.length × (nums.length - 1) / 2
Companies:
Apple
Topics:
Binary Search
Locked Content
Access Restricted: Please Login to access the code editor and test cases.