Merge k Sorted Lists at Yandex
Hard58.8% acceptance
This problem has 50.0% frequency at Yandex.
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 Yandex Questions
Find K Closest ElementsMediumMerge Two Sorted ListsEasyAdd Two NumbersMediumMedian of Two Sorted ArraysHardLRU CacheMedium
View all Yandex questions