Merge k Sorted Lists at Adobe
Hard58.8% acceptance
This problem has 37.5% frequency at Adobe.
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 Adobe Questions
Median of Two Sorted ArraysHardAdd Two NumbersMediumMajority ElementEasyReverse Linked ListEasyDelete Node in a Linked ListMedium
View all Adobe questions