Merge k Sorted Lists at Amazon

Hard58.8% acceptance

This problem has 75.0% frequency at Amazon.

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 List Divide and Conquer Heap (Priority Queue)Merge Sort

Also asked at 52 companies

Accenture Adobe Airbnb Anduril Apple Bloomberg ByteDance Cisco Citadel Cloudflare CME Group Coupang Dell Deloitte DocuSign DoorDash eBay Goldman Sachs Google Huawei+32 more

View Full Problem

Problem Description

Topics

Also asked at 52 companies

More Amazon Questions