Merge lists into a sorted list

Medium

Let's say you're given two linked lists of sorted numbers.

Write a function that merges the two linked lists into a single sorted linked list.

For example, given the two linked lists below:

# Inputs
(1) -> (3) -> (4) -> (7)
(2) -> (4) -> (6) -> (9)

The output should be the following linked list:

# Output
(1) -> (2) -> (3) -> (4) -> (4) -> (6) -> (7) -> (9)

Try it first

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

def merge_lists(head_1: Node, head_2: Node) -> Node:
    # implement merge_lists
    return None

1class Node:
2    def __init__(self, data):
3        self.data = data
4        self.next = None
5
6def merge_lists(head_1: Node, head_2: Node) -> Node:
7    # implement merge_lists
8    return None
9

Solution

8 Essential Linked Lists Coding Interview Problems

Master Linked Lists by trying the coding challenges below.

Want to confidently pass your next coding interview?

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.