← Questions
Merge k sorted lists
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Merge k sorted linked lists into one sorted list. Compare a min-heap of list heads with pairwise merging, and give the time complexity in terms of the total number of nodes and k.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Write and test your solution herePython in your browser, the question's tests level by level, saved for you.Sign in to start coding