K-way merge
You are given k sorted integer lists (a list of lists). Merge them into a single sorted list using a k-way merge with a heap so the work is O(N log k) where N is the total element count, not O(N log N). Some input lists may be empty. Return the fully merged sorted list.
Implement
kway_merge(lists: list[list[int]]) → list[int]Examples
in
[[[1,4,5],[1,3,4],[2,6]]]out[1,1,2,3,4,4,5,6]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[[1,4,5],[1,3,4],[2,6]]][1,1,2,3,4,4,5,6]not run yetsample