Learn
Practice
Newsletter
Resources
Resume
New
F
Toggle theme
0
F
Toggle theme
0
Toggle menu
← Back to All Animations
Find K Pairs with Smallest Sums
Bookmark
Input
Example 1
Example 2
Example 3
Custom
nums1
=
[1, 7, 11]
,
nums2
=
[2, 4, 6]
,
k
=
3
nums1:
1
7
11
nums2:
2
4
6
Min-Heap:
size = 0
(empty)
algo
master
.
io
Step:
Start: Find k pairs with smallest sums using min-heap
0 / 16
Input
Example 1
Example 2
Example 3
Custom
nums1
=
[1, 7, 11]
,
nums2
=
[2, 4, 6]
,
k
=
3
0 / 16
nums1:
1
7
11
nums2:
2
4
6
Min-Heap:
size = 0
(empty)
algo
master
.
io
Step:
Start: Find k pairs with smallest sums using min-heap
