20%off off — LaunchSpecial
Exercises/#23 Merge Two Sorted Lists
#23

Merge Two Sorted Lists

Easy🔗 Linked Lists
50 XP

Problem

Merge two sorted linked lists and return the merged list (also sorted).

Examples

Input: l1 = 1→2→4, l2 = 1→3→4
Output: 1→1→2→3→4→4
linked-listrecursion
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

23 / 150

Your Solution

⚡ JavaScript

to save progress and use AI features