Find the middle of a Linked List

Easy

Given a singly linked list, write a function that returns the middle node.

For example, given the head of the input linked list:

(3) -> (9) -> (7)

Your function should return the node with 9.

You can assume that the list has an odd number of nodes.

Try it first

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

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

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

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.