I started by discussing a priority queue approach to merge the k sorted linked lists. I explained how we could use a min-heap to efficiently retrieve the smallest head node among the lists, and then insert the next node from that list back into the heap. The interviewer asked clarifying questions about edge cases, particularly concerning empty lists and how to handle varying sizes, which I addressed, but I also struggled a bit with the implementation details in subsequent discussions. Overall, I feel I conveyed the concept well but faltered when it came to writing production-level code, especially under pressure.