Merge Two Sorted Lists

Talk it through with a coach who asks guiding questions and gives hints until you reach the answer. Pass to mark the challenge as completed.

The problem

  • easy
  • Pro

Given the heads of two linked lists, each already sorted in ascending order, merge them into one sorted list by relinking their nodes. Explain your approach and its cost.

Talk this problem through with an AI coach

This is a Pro challenge. Sign in with Google, then upgrade to start a voice session.

Start free →