Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Merge k Sorted Lists
Bookmark
Collect and Sort
Min-Heap
Divide and Conquer
Input
Example 1
Example 2
Example 3
Custom
lists
=
[[1,4,5],[1,3,4],[2,6]]
input lists
values ·
0
collected · linked
0
L0
∅
1
4
5
L1
∅
1
3
4
L2
∅
2
6
values
copy every value out, sort them, then link the nodes back up
input lists
values ·
0
collected · linked
0
L0
∅
1
4
5
L1
∅
1
3
4
L2
∅
2
6
values
copy every value out, sort them, then link the nodes back up
input lists
values ·
2
collected · linked
0
L0
∅
1
4
5
L1
∅
1
3
4
L2
∅
2
6
values
1
4
collect
4
from
L0
input lists
values ·
4
collected · linked
0
L0
∅
1
4
5
L1
∅
1
3
4
L2
∅
2
6
values
1
4
5
1
collect
1
from
L1
input lists
values ·
6
collected · linked
0
L0
∅
1
4
5
L1
∅
1
3
4
L2
∅
2
6
values
1
4
5
1
3
4
collect
4
from
L1
input lists
values ·
8
collected · linked
0
L0
∅
1
4
5
L1
∅
1
3
4
L2
∅
2
6
values
1
4
5
1
3
4
2
6
collect
6
from
L2
input lists
values ·
8
collected · linked
1
L0
∅
1
4
5
L1
∅
1
3
4
L2
∅
2
6
out
dummy
1
4
5
1
3
4
2
6
link
1
into the merged list ·
1
/ 8
input lists
values ·
8
collected · linked
3
L0
∅
1
4
5
L1
∅
1
3
4
L2
∅
2
6
out
dummy
1
4
5
1
3
4
2
6
link
2
into the merged list ·
3
/ 8
input lists
values ·
8
collected · linked
5
L0
∅
1
4
5
L1
∅
1
3
4
L2
∅
2
6
out
dummy
1
4
5
1
3
4
2
6
link
4
into the merged list ·
5
/ 8
input lists
values ·
8
collected · linked
7
L0
∅
1
4
5
L1
∅
1
3
4
L2
∅
2
6
out
dummy
1
4
5
1
3
4
2
6
link
5
into the merged list ·
7
/ 8
input lists
values ·
8
collected · linked
8
L0
∅
1
4
5
L1
∅
1
3
4
L2
∅
2
6
out
dummy
1
4
5
1
3
4
2
6
merged = [1, 1, 2, 3, 4, 4, 5, 6]
algo
master
.
io
Step:
Collect every value, sort them, then rebuild one list
0 / 19
Input
Example 1
Example 2
Example 3
Custom
lists
=
[[1,4,5],[1,3,4],[2,6]]
0 / 19
algo
master
.
io
Step:
Collect every value, sort them, then rebuild one list
