Grokking Data Structures & Algorithms for Coding Interviews
Ask Author
Back to course home

0% completed

Vote For New Content
Problem 3: Merge Two Sorted Lists (easy)
Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Problem Statement

Given the head of two sorted linked lists, l1 and l2.

Return a new sorted list created by merging together the nodes of the first two lists.

Examples

  1. Example 1:

    • Input: 
      [1, 3, 5]
[2, 4, 6]
    • Expected Output: 
      [1, 2, 3, 4, 5, 6]
    • Justification: Merging the two sorted linked lists, node by node, results in a single sorted linked list containing all elements from both input lists.

  2. Example 2:

    • Input: 
      [2, 4, 6]
[1, 3, 5]
    • Expected Output: 
      [1, 2, 3, 4, 5, 6]
    • Justification: Both lists are in ascending order; merging them node by node in ascending order gives us the sorted linked list with all elements.

  3. Example 3:

    • Input: 
      [1, 2, 3]
[4, 5, 6]
    • Expected Output: 
      [1, 2, 3, 4, 5, 6]
    • Justification: As the first list contains all smaller elements, combining them results in a new list with elements from the first list followed by the second one.

Constraints:

  • The number of nodes in both lists is in the range [0, 50].
  • -100 <= Node.val <= 100
  • Both list1 and list2 are sorted in non-decreasing order.

Try it yourself

Try solving this question here:

Python3
Python3
. . . .

.....

.....

.....

Like the course? Get enrolled and start learning!

Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible