The question was about merging k sorted linked lists. I started by explaining a heap-based approach, using a priority queue to efficiently merge the lists. I walked through the algorithm step-by-step, discussing how we'd insert each head of the linked lists into the priority queue, and then repeatedly extract the smallest element. The interviewer seemed engaged, nodding along, but I struggled a bit with the coding part, making some syntax errors.