Find Middle Element of Linked List in DSA Java - Build from Scratch

Find Middle Element of Linked List

📖 Scenario: You are working with a simple linked list that stores numbers. You want to find the middle number in the list, just like finding the middle book on a shelf.

🎯 Goal: Build a Java program that creates a linked list, sets up a way to find the middle element, and then prints that middle element.

📋 What You'll Learn

Create a linked list with exactly these numbers in order: 10, 20, 30, 40, 50

Create a variable to track the middle position

Use a loop to find the middle element of the linked list

Print the value of the middle element

💡 Why This Matters

🌍 Real World

Finding the middle element is useful in many situations like splitting data evenly or balancing tasks.

💼 Career

Understanding linked lists and how to access elements is a basic skill for software developers working with data structures.

1

Create the Linked List

Create a linked list called list and add these exact integers in order: 10, 20, 30, 40, 50.

DSA Java

import java.util.LinkedList;

public class Main {
    public static void main(String[] args) {
        // Create linked list and add elements
        // Your code here
    }
}

Hint

Use LinkedList<Integer> and add() method to add numbers.

2

Set Up Middle Position Variable

Create an integer variable called middleIndex and set it to the middle position of the list using list.size().

DSA Java

import java.util.LinkedList;

public class Main {
    public static void main(String[] args) {
        LinkedList list = new LinkedList();
        list.add(10);
        list.add(20);
        list.add(30);
        list.add(40);
        list.add(50);
        
        // Calculate middle index
        // Your code here
    }
}

Hint

Use list.size() to get the number of elements, then divide by 2.

3

Find the Middle Element

Create an integer variable called middleElement and set it to the element at middleIndex in list using list.get(middleIndex).

DSA Java

import java.util.LinkedList;

public class Main {
    public static void main(String[] args) {
        LinkedList list = new LinkedList();
        list.add(10);
        list.add(20);
        list.add(30);
        list.add(40);
        list.add(50);
        
        int middleIndex = list.size() / 2;
        
        // Get middle element
        // Your code here
    }
}

Hint

Use list.get(middleIndex) to access the middle element.

4

Print the Middle Element

Print the value of middleElement using System.out.println(middleElement);.

DSA Java

import java.util.LinkedList;

public class Main {
    public static void main(String[] args) {
        LinkedList list = new LinkedList();
        list.add(10);
        list.add(20);
        list.add(30);
        list.add(40);
        list.add(50);
        
        int middleIndex = list.size() / 2;
        int middleElement = list.get(middleIndex);
        
        // Print the middle element
        // Your code here
    }
}

Hint

Use System.out.println(middleElement); to show the middle number.

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 traverse half the count again

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

D. Reverse the list and pick the first element

Solution

1. Step 1: Understand the two-pointer technique

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

2. Step 2: Identify when to stop

   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 C

4. Quick Check:

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

Hint: Move fast pointer twice as fast as slow pointer [OK]

Common Mistakes:

• Moving both pointers at the same speed
• Counting nodes first then traversing again
• Stopping when slow pointer reaches null

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

easy

A. Node slow = head; Node fast = head;

B. Node slow = null; Node fast = head;

C. Node slow = head.next; Node fast = head.next.next;

D. Node slow = head; Node fast = head.next;

Solution

1. Step 1: Initialize both pointers at the start

   Both slow and fast pointers should start at the head node to cover the entire list.

2. Step 2: Check initialization correctness

   Node slow = head; Node fast = head; initializes both pointers to head, which is correct for the two-pointer approach.

3. Final Answer:

   Node slow = head; Node fast = head; -> Option A

4. Quick Check:

   Both pointers start at head [OK]

Hint: Start both pointers at head node [OK]

Common Mistakes:

• Starting slow pointer at null
• Starting fast pointer ahead causing null errors
• Skipping nodes at initialization

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

class Node {
  int data;
  Node next;
  Node(int d) { data = d; next = null; }
}

public class Test {
  public static void main(String[] args) {
    Node head = new Node(10);
    head.next = new Node(20);
    head.next.next = new Node(30);
    head.next.next.next = new Node(40);
    head.next.next.next.next = new Node(50);

    Node slow = head, fast = head;
    while (fast != null && fast.next != null) {
      slow = slow.next;
      fast = fast.next.next;
    }
    System.out.println(slow.data);
  }
}

medium

A. 40

B. 20

C. 50

D. 30

Solution

1. Step 1: Trace slow and fast pointers

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

2. Step 2: Identify slow pointer position at loop end

   Slow pointer is at node with data 30, which is the middle element.

3. Final Answer:

   30 -> Option D

4. Quick Check:

   Middle element = 30 [OK]

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

Common Mistakes:

• Printing fast pointer data instead of slow
• Off-by-one errors in loop condition
• Assuming middle is first or last node

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

Node slow = head;
Node fast = head.next;
while (fast != null && fast.next != null) {
  slow = slow.next;
  fast = fast.next.next;
}
System.out.println(slow.data);

medium

A. Print fast.data instead of slow.data

B. Initialize fast pointer to head instead of head.next

C. Move slow pointer two steps instead of one

D. Change while condition to only check fast != null

Solution

1. Step 1: Analyze pointer initialization

   Fast pointer starts at head.next, which causes the slow pointer to point to the first middle in even-length lists.

2. Step 2: Correct initialization for consistent middle

   Initialize fast pointer at head to find the second middle element in even-length lists.

3. Final Answer:

   Initialize fast pointer to head instead of head.next -> Option B

4. Quick Check:

   Fast pointer starts at head for correct middle [OK]

Hint: Start fast pointer at head for correct middle [OK]

Common Mistakes:

• Starting fast pointer at head.next causing off-by-one
• Incorrect loop condition causing null pointer
• Moving slow pointer incorrectly

5. Given a singly linked list with an even number of nodes, how can you modify the two-pointer approach to return the first middle element instead of the second?

hard

A. Initialize fast pointer to head.next and use the same loop condition

B. Initialize slow pointer to head.next and fast pointer to head

C. Change loop condition to fast.next != null

D. Move slow pointer two steps and fast pointer one step

Solution

1. Step 1: Understand default behavior

   Starting both pointers at head returns the second middle in even-length lists.

2. Step 2: Modify initialization to get first middle

   Starting fast pointer at head.next causes slow pointer to land on the first middle.

3. Final Answer:

   Initialize fast pointer to head.next and use the same loop condition -> Option A

4. Quick Check:

   Fast starts at head.next for first middle [OK]

Hint: Start fast pointer one step ahead for first middle [OK]

Common Mistakes:

• Changing loop condition incorrectly
• Moving pointers in wrong directions
• Starting slow pointer ahead causing errors