Find Middle Element of Linked List in DSA Python - Practice Problems & Challenges

Challenge - 5 Problems

❓ Predict Output

intermediate

Find the middle element output

What is the output of the following code that finds the middle element of a linked list?

DSA Python

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

def find_middle(head):
    slow = head
    fast = head
    while fast and fast.next:
        slow = slow.next
        fast = fast.next.next
    return slow.data

# Linked list: 10 -> 20 -> 30 -> 40 -> 50 -> None
head = Node(10)
head.next = Node(20)
head.next.next = Node(30)
head.next.next.next = Node(40)
head.next.next.next.next = Node(50)

print(find_middle(head))

A 50

B 20

C 40

D 30

💡 Hint

Use two pointers: one moves one step, the other moves two steps.

The slow pointer moves one step at a time, the fast pointer moves two steps. When fast reaches the end, slow is at the middle.

For the list 10 -> 20 -> 30 -> 40 -> 50, the middle is 30.

❓ Predict Output

intermediate

Middle element in even length list

What is the output of the code when the linked list has an even number of elements?

DSA Python

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

def find_middle(head):
    slow = head
    fast = head
    while fast and fast.next:
        slow = slow.next
        fast = fast.next.next
    return slow.data

# Linked list: 1 -> 2 -> 3 -> 4 -> None
head = Node(1)
head.next = Node(2)
head.next.next = Node(3)
head.next.next.next = Node(4)

print(find_middle(head))

A 2

B 3

C 1

D 4

💡 Hint

When even number of nodes, the function returns the second middle node.

For even length lists, the slow pointer ends at the second middle node.

Here, the middle nodes are 2 and 3, so output is 3.

🔧 Debug

advanced

Identify the error in middle element code

What error does the following code produce when trying to find the middle element of a linked list?

DSA Python

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

def find_middle(head):
    slow = head
    fast = head
    while fast.next and fast.next.next:
        slow = slow.next
        fast = fast.next.next
    return slow.data

head = None
print(find_middle(head))

A AttributeError

B IndexError

C None

D No error, output is 10

💡 Hint

Check the while loop condition for short lists.

The condition 'while fast.next and fast.next.next' fails when fast is None, causing AttributeError when accessing fast.next.

🧠 Conceptual

advanced

Why use two pointers to find middle?

Why is the two-pointer technique efficient for finding the middle element of a linked list?

A It traverses the list only once, using two pointers moving at different speeds.

B It uses extra memory to store all elements and then finds the middle.

C It sorts the list first and then picks the middle element.

D It counts the total elements first, then traverses again to the middle.

💡 Hint

Think about how many times the list is traversed.

The two-pointer method finds the middle in one pass by moving one pointer twice as fast as the other.

This avoids counting or extra memory.

❓ Predict Output

expert

Output of middle element after list modification

What is the output after modifying the linked list and then finding the middle element?

DSA Python

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

def find_middle(head):
    slow = head
    fast = head
    while fast and fast.next:
        slow = slow.next
        fast = fast.next.next
    return slow.data

head = Node(1)
head.next = Node(2)
head.next.next = Node(3)
head.next.next.next = Node(4)
head.next.next.next.next = Node(5)

# Remove the third node (data=3)
head.next.next = head.next.next.next

print(find_middle(head))

A 2

B 3

C 4

D 5

💡 Hint

After removal, the list is 1 -> 2 -> 4 -> 5.

After removing node with data 3, the list is 1 -> 2 -> 4 -> 5.

The middle nodes are 2 and 4, so the function returns the second middle, 4.

Practice

1. What is the main idea behind finding the middle element of a singly linked list using the two-pointer technique?

easy

A. Use two pointers both moving one step at a time

B. Count all nodes first, then access the middle by index

C. Reverse the list and pick the first element

D. Use one slow pointer moving one step and one fast pointer moving two steps until fast reaches the end

Solution

1. Step 1: Understand two-pointer movement

   The slow pointer moves one node at a time, while the fast pointer moves two nodes at a time.

2. Step 2: Identify middle when fast pointer ends

   When the fast pointer reaches the end (null), the slow pointer will be at the middle node.

3. Final Answer:

   Use one slow pointer moving one step and one fast pointer moving two steps until fast reaches the end -> Option D

4. Quick Check:

   Two-pointer technique = slow one step, fast two steps [OK]

Hint: Move fast pointer twice as fast as slow to find middle [OK]

Common Mistakes:

• Moving both pointers at the same speed
• Counting nodes first instead of using pointers
• Reversing the list unnecessarily

2. Which of the following Python code snippets correctly initializes pointers to find the middle of a linked list named head?

easy

A. slow = head\nfast = head

B. slow = head.next\nfast = head.next.next

C. slow = null\nfast = head

D. slow = head\nfast = null

Solution

1. Step 1: Initialize both pointers at head

   To start traversal, both slow and fast pointers should begin at the head node.

2. Step 2: Confirm correct initialization

   Setting slow = head and fast = head allows fast to move two steps and slow one step safely.

3. Final Answer:

   slow = head\nfast = head -> Option A

4. Quick Check:

   Both pointers start at head [OK]

Hint: Start both pointers at head node [OK]

Common Mistakes:

• Starting slow or fast at null
• Starting fast pointer too far ahead
• Skipping initialization of pointers

3. What will be the output of the following code snippet that finds the middle element of a linked list?

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

def find_middle(head):
    slow = head
    fast = head
    while fast and fast.next:
        slow = slow.next
        fast = fast.next.next
    return slow.val

# Creating linked list: 10 -> 20 -> 30 -> 40 -> 50
head = Node(10)
head.next = Node(20)
head.next.next = Node(30)
head.next.next.next = Node(40)
head.next.next.next.next = Node(50)

print(find_middle(head))

medium

A. 30

B. 20

C. 40

D. 50

Solution

1. Step 1: Trace pointer movements

   Initially, slow=10, fast=10. After first loop: slow=20, fast=30. Second loop: slow=30, fast=50. Third loop ends as fast.next is null.

2. Step 2: Identify slow pointer value

   Slow pointer is at node with value 30 when loop ends, so 30 is middle.

3. Final Answer:

   30 -> Option A

4. Quick Check:

   Middle element = 30 [OK]

Hint: Slow pointer lands on middle when fast reaches end [OK]

Common Mistakes:

• Returning fast pointer value instead of slow
• Off-by-one errors in loop condition
• Confusing node values during tracing

4. Identify the error in the following code that attempts to find the middle element of a linked list and fix it:

def find_middle(head):
    slow = head
    fast = head
    while fast.next and fast.next.next:
        slow = slow.next
        fast = fast.next.next
    return slow.val

medium

A. Return fast.val instead of slow.val

B. Change loop condition to 'while fast and fast.next' to avoid NoneType errors

C. Initialize slow and fast to null instead of head

D. Remove the loop entirely and return head.val

Solution

1. Step 1: Analyze loop condition

   The condition 'while fast.next and fast.next.next' can cause an error if fast is null initially.

2. Step 2: Correct loop condition

   Changing it to 'while fast and fast.next' ensures fast is not null before accessing fast.next.

3. Final Answer:

   Change loop condition to 'while fast and fast.next' to avoid NoneType errors -> Option B

4. Quick Check:

   Safe loop condition = while fast and fast.next [OK]

Hint: Check fast pointer is not null before accessing next [OK]

Common Mistakes:

• Accessing fast.next without checking fast
• Returning wrong pointer's value
• Incorrect pointer initialization

5. Given a linked list with an even number of nodes, which node will the two-pointer method return as the middle?
For example, in the list 1 -> 2 -> 3 -> 4 -> null, what will be the middle element returned by the standard two-pointer approach?

hard

A. Node with value 2 (the first middle)

B. Node with value 1 (head node)

C. Node with value 3 (the second middle)

D. Node with value 4 (last node)

Solution

1. Step 1: Trace pointers on even-length list

   Start: slow=1, fast=1. Loop 1: slow=2, fast=3. Loop 2: fast tries to move two steps but reaches end, loop stops.

2. Step 2: Identify slow pointer position

   Slow pointer is at node with value 3 when loop ends, which is the second middle node.

3. Final Answer:

   Node with value 3 (the second middle) -> Option C

4. Quick Check:

   Two-pointer returns second middle in even list [OK]

Hint: Two-pointer method returns second middle in even-length lists [OK]

Common Mistakes:

• Assuming it returns first middle node
• Confusing head or last node as middle
• Not tracing pointer steps carefully