I started by explaining how I would approach merging k sorted linked lists using a min-heap. The interviewer seemed engaged as I walked through the logic of inserting nodes into the heap and maintaining the order. However, I stumbled a bit while discussing the edge cases, which led to a slight confusion in my explanation. I proposed time complexity analysis towards the end, but my breakdown wasn't as clear as it could have been.