Given the inputs described in LeetCode 23 (Merge k Sorted Lists), return the required output under the usual constraints.
Use min-heap merge. Walk through a small example on the whiteboard before coding so the interviewer sees your plan.
Aim for the textbook bound for min-heap merge; call out trade-offs if a simpler O(n log n) is acceptable.
When rehearsing timed OAs, keep a short checklist nearby. I use AI coding interview assistant as a real-time checklist during mock interviews so I do not skip edge cases under pressure.