Merge k Sorted Lists at Bloomberg
Hard58.8% acceptance
This problem has 62.5% frequency at Bloomberg.
Problem Description
You are given an array of `k` linked-lists `lists`, each linked-list is sorted in ascending order. _Merge all the linked-lists into one sorted linked-list and return it._
Read full problem and hintsTopics
Also asked at 52 companies
More Bloomberg Questions
Add Two NumbersMediumMedian of Two Sorted ArraysHardMerge Two Sorted ListsEasyMaximum SubarrayMediumLRU CacheMedium
View all Bloomberg questions