Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Find K Pairs with Smallest Sums
Bookmark
Generate All Pairs
Min-Heap
Input
Example 1
Example 2
Example 3
Custom
nums1
=
[1, 7, 11]
,
nums2
=
[2, 4, 6]
,
k
=
3
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
result
generate every pair, sort by sum, take the first k
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
result
generate every pair, sort by sum, take the first k
found =
0
/ 3
pairs =
2
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
all pairs (nums1 x nums2)
result
1+2
3
1+4
5
pair
(1, 4)
· sum
5
found =
0
/ 3
pairs =
3
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
all pairs (nums1 x nums2)
result
1+2
3
1+4
5
1+6
7
pair
(1, 6)
· sum
7
found =
0
/ 3
pairs =
5
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
all pairs (nums1 x nums2)
result
1+2
3
1+4
5
1+6
7
7+2
9
7+4
11
pair
(7, 4)
· sum
11
found =
0
/ 3
pairs =
6
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
all pairs (nums1 x nums2)
result
1+2
3
1+4
5
1+6
7
7+2
9
7+4
11
7+6
13
pair
(7, 6)
· sum
13
found =
0
/ 3
pairs =
8
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
all pairs (nums1 x nums2)
result
1+2
3
1+4
5
1+6
7
7+2
9
7+4
11
7+6
13
11+2
13
11+4
15
pair
(11, 4)
· sum
15
found =
0
/ 3
pairs =
9
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
all pairs (nums1 x nums2)
result
1+2
3
1+4
5
1+6
7
7+2
9
7+4
11
7+6
13
11+2
13
11+4
15
11+6
17
pair
(11, 6)
· sum
17
found =
1
/ 3
pairs =
9
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
all pairs, sorted by sum
result
(1,2)
1+4
5
1+6
7
7+2
9
7+4
11
7+6
13
11+2
13
11+4
15
11+6
17
result +=
(1, 2)
·
1
/ 3
found =
2
/ 3
pairs =
9
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
all pairs, sorted by sum
result
(1,2)
(1,4)
1+6
7
7+2
9
7+4
11
7+6
13
11+2
13
11+4
15
11+6
17
result +=
(1, 4)
·
2
/ 3
found =
3
/ 3
pairs =
9
nums1
nums2
1
7
11
2
4
6
0
1
2
0
1
2
all pairs, sorted by sum
result
(1,2)
(1,4)
(1,6)
7+2
9
7+4
11
7+6
13
11+2
13
11+4
15
11+6
17
result = [(1,2) (1,4) (1,6)]
algo
master
.
io
Step:
Build every pair, sort by sum, then take the 3 smallest
0 / 14
Input
Example 1
Example 2
Example 3
Custom
nums1
=
[1, 7, 11]
,
nums2
=
[2, 4, 6]
,
k
=
3
0 / 14
algo
master
.
io
Step:
Build every pair, sort by sum, then take the 3 smallest
