Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Find K-th Smallest Pair Distance
Bookmark
Brute Force
Bucket Sort
Binary Search + Two Pointers
Input
Example 1
All same
Example 2
Sorted 4
5 elements
Custom
nums
=
[1, 3, 1]
,
k
=
1
k = 1
0
1
1
1
2
3
k = 1
0
1
1
1
2
3
k = 1
0
1
1
1
2
3
k = 1, collect every pair distance
0
1
1
1
2
3
k = 1, pair (1, 1) → dist = 0
0
1
1
1
2
3
i
j
k = 1, added 0. Collected 1 distance(s)
0
1
1
1
2
3
i
j
k = 1, added 2. Collected 2 distance(s)
0
1
1
1
2
3
i
j
k = 1, pair (1, 3) → dist = 2
0
1
1
1
2
3
i
j
k = 1, added 2. Collected 3 distance(s)
0
1
1
1
2
3
i
j
Sorted: [0, 2, 2]
0
1
1
1
2
3
Answer: 1-th smallest distance = 0
0
1
1
1
2
3
algo
master
.
io
Step:
Find the 1-th smallest pair distance by checking every pair
0 / 10
Input
Example 1
All same
Example 2
Sorted 4
5 elements
Custom
nums
=
[1, 3, 1]
,
k
=
1
0 / 10
algo
master
.
io
Step:
Find the 1-th smallest pair distance by checking every pair
