Problem 23 · Hard

Merge K Sorted Lists

Use a min-heap over current list heads to repeatedly pick the global minimum in O(N log k).

Open the interactive visualisation