Solo practice workspace

Interview Coder drill

Merge K Sorted Lists

30:00

Hard

Given K sorted lists of integers (one per line), merge them into one sorted list and print the values space-separated.

Example 1

Input: lists = [[1,4,5],[1,3,4],[2,6]]

Output: 1 1 2 3 4 4 5 6

All lists merged and sorted

Constraints

k == number of lines of input0 <= k <= 10^4

Recall before you code

Capture your plan, then rate how clearly you recalled it before submitting.

What cues point to the Heap / Top K pattern?What invariant or template will you maintain?Which edge cases could break your approach?

How well did you recall the approach?

solution.py

Runs: 0 | Submissions: 0

Loading Python runtime...