I started off by explaining the problem of merging k sorted linked lists. I tackled it with a min-heap approach since it seemed efficient and sophisticated. The interviewer nodded along, which felt encouraging.

Then, I attempted to write the code on the whiteboard. I stumbled with some syntax errors and forgot to handle edge cases. The interviewer pointed out a few things to improve my solution, like using a priority queue for better efficiency. Overall, I managed to implement the solution but felt like I rushed through some parts.