codejeet

Merge k Sorted Lists at Oracle

Hard58.8% acceptance

This problem has 75.0% frequency at Oracle.

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 hints

Topics

Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort

Also asked at 52 companies

AccentureAdobeAirbnbAmazonAndurilAppleBloombergByteDanceCiscoCitadelCloudflareCME GroupCoupangDellDeloitteDocuSignDoorDasheBayGoldman SachsGoogle+32 more
View Full Problem

More Oracle Questions

LRU CacheMediumSliding Window MaximumHardTop K Frequent ElementsMediumReverse Linked ListEasyFind Median from Data StreamHard
View all Oracle questions