Merge Two Sorted Lists — Easy Coding Interview Question

You are given the heads of two sorted linked lists. Merge them into one sorted list.

Example

Input: list1 = [1,2,4], list2 = [1,3,4]

Output: [1,1,2,3,4,4]

Constraints

• 0 ≤ list length ≤ 50

Topics & Companies

Topics: linked-list, recursion

Asked by: Amazon, Google, Meta, Microsoft, Apple, Bloomberg

Optimal Solution Complexity

Time complexity: O(n+m). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns