Find Middle Element of Linked List in DSA Python - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to create a new node with the given value.

DSA Python

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

Drag options to blanks, or click blank then click option'

ANone

Bvalue

Cnode

Ddata

Attempts:

3 left

💡 Hint

Common Mistakes

Using a variable name not defined in the constructor.

Assigning None instead of the input data.

The constructor assigns the input parameter 'data' to the node's data attribute.

2fill in blank

medium

Complete the code to move the slow pointer one step forward in the linked list.

DSA Python

slow = slow[1]

Drag options to blanks, or click blank then click option'

A.prev

B.next

C.next.next

D.data

Attempts:

3 left

💡 Hint

Common Mistakes

Moving two steps instead of one.

Trying to access a non-existent 'prev' attribute.

To move one step forward, we use slow.next.

3fill in blank

hard

Fix the error in the while loop condition to correctly check if fast and fast.next exist.

DSA Python

while fast is not None and fast[1] is not None:
    slow = slow.next
    fast = fast.next.next

Drag options to blanks, or click blank then click option'

A.next

B.next.next

C.data

D.prev

Attempts:

3 left

💡 Hint

Common Mistakes

Checking fast.next.next instead of fast.next.

Checking fast.prev which does not exist.

We must check if fast.next is not None before moving fast two steps.

4fill in blank

hard

Fill both blanks to create a function that returns the middle node's data.

DSA Python

def find_middle(head):
    slow = head
    fast = head
    while fast is not None and fast[1] is not None:
        slow = slow[2]
        fast = fast.next.next
    return slow.data

Drag options to blanks, or click blank then click option'

A.next

B.prev

C.next.next

D.data

Attempts:

3 left

💡 Hint

Common Mistakes

Using .prev which does not exist.

Moving slow two steps instead of one.

We check fast.next and move slow one step with slow.next.

5fill in blank

hard

Fill all three blanks to create a dictionary comprehension that maps nodes to their data if data is even.

DSA Python

result = [1]: [2] for node in nodes if node.data [3] 0

Drag options to blanks, or click blank then click option'

Anode

Bnode.data

C% 2 ==

D==

Attempts:

3 left

💡 Hint

Common Mistakes

Using '==' instead of '% 2 =='.

Swapping key and value in the dictionary.

We map node to node.data and check if node.data % 2 == 0 for even data.

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