Problem - Merge K Sorted Lists

You are given an array of $k$ linked lists, each sorted in ascending order. Merge all the linked lists into one sorted linked list.

You're facing a famous interview problem that tests your skills. The heap-based solution is clean and efficient. The constraint is up to $10^4$ lists with up to $500$ nodes each.