##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Classic interview problem
You are given an array of 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 lists with up to nodes each.
