Merge k Sorted Lists at Apple
Hard58.9% acceptance
This problem has 66.7% 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 45 companies
More Apple Questions
LRU CacheMediumReverse Linked ListEasyTop K Frequent ElementsMediumKth Largest Element in an ArrayMediumMaximum SubarrayMedium
View all Apple questions