Remove node from a Linked List

Easy

You're given a reference to a node in a singly linked list of numbers.

Write a function that removes that node from its linked list.

For example, given the linked list:

(1) -> (5) -> (7) -> (2)

If your function is passed a reference to the second node with the data 5 as an input, the linked list should be become:

(1) -> (7) -> (2)

The input node can be any node in the list except the tail.

Try it first

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

def remove_node(node: Node):
    # remove the input node
    return

1class Node:
2    def __init__(self, data):
3        self.data = data
4        self.next = None
5
6def remove_node(node: Node):
7    # remove the input node
8    return
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.