20%off off — LaunchSpecial
Exercises/#67 Merge K Sorted Lists
#67

Merge K Sorted Lists

Hard🔍 Sorting & Searching
120 XP

Problem

Merge k sorted linked lists and return one sorted list.

Examples

Input: lists=[[1,4,5],[1,3,4],[2,6]]
Output: 1→1→2→3→4→4→5→6
heaplinked-listdivide-conquer
AI Assistant— powered by AI

Unlock hints progressively — start gentle, go deeper only if needed.

💡

Level 1: Gentle Nudge

A subtle direction

🗺️

Level 2: Approach

The algorithm to use

🔍

Level 3: Detailed

Step-by-step guidance

67 / 150

Your Solution

⚡ JavaScript

to save progress and use AI features