Reverse a linked list

Medium

Let's say you're given a linked list. Write a function that reverses the linked list.

For example, passing a list with the data (3) -> (5) -> (6) -> (7) should return a linked list with pointers reversed: (7) -> (6) -> (5) -> (3).

Try it first

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

def reverse_linked_list(head: Node) -> Node:
    # implement reverse_linked_list
    return head

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

Solution

8 Essential Linked Lists Coding Interview Problems

Master Linked Lists by trying the coding challenges below.

1.Insert NodeEasy
2.Remove NodeEasy
3.Find the MiddleEasy
4.Add Linked ListsEasy
5.Reverse Linked ListMedium
6.Detect CycleMedium
7.Merge Linked ListsMedium
8.Pivot Linked ListHard

Want to confidently pass your next coding interview?

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