Merge k Sorted Lists at Apple
Hard58.8% acceptance
This problem has 75.0% frequency at Apple.
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 Apple Questions
LRU CacheMediumMaximum SubarrayMediumReverse Linked ListEasyKth Largest Element in an ArrayMediumTop K Frequent ElementsMedium
View all Apple questions