Merge K Sorted Linked Lists into One Sorted List

bytedance Given a list of K sorted linked lists, merge them into a single sorted linked list, and return the result. Assume that the total number of nodes across all linked lists does not exceed N. Example Input [[1->4->5],[1->3->4],[2->6]]