Find Middle Element of Linked List in DSA Javascript - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is the middle element of a linked list?

The middle element is the node that is in the center of the linked list. If the list has an odd number of nodes, it's the exact middle. If even, it is usually the second of the two middle nodes.

beginner

How can you find the middle element of a linked list using two pointers?

Use two pointers: a slow pointer that moves one step at a time, and a fast pointer that moves two steps at a time. When the fast pointer reaches the end, the slow pointer will be at the middle.

intermediate

Why does the two-pointer method work to find the middle element?

Because the fast pointer moves twice as fast, by the time it reaches the end, the slow pointer has moved half the distance, landing exactly at the middle node.

beginner

What is the time complexity of finding the middle element using the two-pointer method?

The time complexity is O(n), where n is the number of nodes, because we traverse the list only once.

beginner

Can you find the middle element of a linked list without knowing its length beforehand?

Yes, the two-pointer method does not require knowing the length. It finds the middle in one pass without extra space.

What does the slow pointer do in the two-pointer method to find the middle of a linked list?

A Skips every other node

B Moves one node at a time

C Moves two nodes at a time

D Moves three nodes at a time

The slow pointer moves one node at a time to track the middle position.

When does the slow pointer point to the middle element in the two-pointer method?

A When the fast pointer reaches the end

B When the slow pointer reaches the end

C After two full passes

D At the start of the list

The slow pointer is at the middle when the fast pointer reaches the end of the list.

What is the time complexity of finding the middle element using the two-pointer method?

A O(1)

B O(n^2)

C O(log n)

D O(n)

The method traverses the list once, so it is O(n).

If a linked list has 6 nodes, which node will the slow pointer point to as the middle using the two-pointer method?

A 2nd node

B 3rd node

C 4th node

D 5th node

For even nodes, the slow pointer stops at the second of the two middle nodes, which is the 4th node.

Can the two-pointer method find the middle element without extra memory?

A Yes

B No

C Only with extra arrays

D Only with recursion

The method uses only pointers and no extra memory.

Explain how the two-pointer method finds the middle element of a linked list.

Think about how fast and slow pointers move differently.

Describe the time complexity and space complexity of finding the middle element using the two-pointer method.

Consider how many times you visit each node and extra memory used.

Practice

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

easy

A. Reverse the list and pick the last element

B. Use one pointer moving twice as fast as the other; when fast reaches end, slow is at middle

C. Count all nodes first, then traverse again to the middle node

D. Use two pointers moving at the same speed and pick the first pointer's position

Solution

1. Step 1: Understand two-pointer technique

   One pointer (fast) moves two nodes at a time, the other (slow) moves one node at a time.

2. Step 2: Identify middle when fast pointer reaches end

   When fast pointer reaches the end of the list, slow pointer will be at the middle node.

3. Final Answer:

   Use one pointer moving twice as fast as the other; when fast reaches end, slow is at middle -> Option B

4. Quick Check:

   Two-pointer technique = fast & slow pointers [OK]

Hint: Fast pointer moves 2x speed, slow pointer at middle when fast ends [OK]

Common Mistakes:

• Trying to reverse the list unnecessarily
• Counting nodes twice instead of using two pointers
• Moving both pointers at the same speed

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

easy

A. let slow = head.next; let fast = head;

B. let slow = null; let fast = head.next;

C. let slow = head; let fast = head;

D. let slow = head; let fast = null;

Solution

1. Step 1: Initialize both pointers at head

   Both slow and fast pointers start at the head node to begin traversal.

2. Step 2: Confirm correct initialization

   Starting both at head allows fast to move ahead and slow to lag behind properly.

3. Final Answer:

   let slow = head; let fast = head; -> Option C

4. Quick Check:

   Both pointers start at head [OK]

Hint: Start both slow and fast pointers at head node [OK]

Common Mistakes:

• Starting slow or fast at null or head.next incorrectly
• Swapping slow and fast initialization
• Starting fast pointer at null causing errors

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

class Node {
  constructor(value) {
    this.value = value;
    this.next = null;
  }
}

const 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);

function findMiddle(head) {
  let slow = head;
  let fast = head;
  while (fast !== null && fast.next !== null) {
    slow = slow.next;
    fast = fast.next.next;
  }
  return slow.value;
}

console.log(findMiddle(head));

medium

A. 20

B. 50

C. 40

D. 30

Solution

1. Step 1: Trace slow and fast pointers through the list

   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 at loop end

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

3. Final Answer:

   30 -> Option D

4. Quick Check:

   Middle element = 30 [OK]

Hint: Fast moves 2 steps, slow moves 1; slow ends at middle [OK]

Common Mistakes:

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

4. The following code is intended to find the middle element of a linked list, but it has a bug. What is the bug?

function findMiddle(head) {
  let slow = head;
  let fast = head.next;
  while (fast !== null && fast.next !== null) {
    slow = slow.next;
    fast = fast.next.next;
  }
  return slow.value;
}

medium

A. Fast pointer should start at head, not head.next

B. Slow pointer should start at head.next, not head

C. Loop condition should be while (fast !== null)

D. Return statement should return fast.value

Solution

1. Step 1: Analyze pointer initialization

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

2. Step 2: Correct initialization for accurate middle

   Fast pointer should start at head to ensure slow pointer reaches the true middle node.

3. Final Answer:

   Fast pointer should start at head, not head.next -> Option A

4. Quick Check:

   Fast pointer must start at head [OK]

Hint: Start fast pointer at head to avoid off-by-one errors [OK]

Common Mistakes:

• Starting fast pointer at head.next causing wrong middle
• Changing loop condition incorrectly
• Returning fast pointer value instead of slow

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 middle element?

hard

A. Initialize fast pointer at head.next and slow pointer at head

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

C. Move slow pointer twice and fast pointer once in the loop

D. Return fast pointer's value instead of slow pointer's value

Solution

1. Step 1: Understand default behavior

   Normally, both pointers start at head, so slow points to 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 move fewer steps, landing on the first middle node.

3. Final Answer:

   Initialize fast pointer at head.next and slow pointer at head -> Option A

4. Quick Check:

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

Hint: Start fast at head.next to get first middle in even lists [OK]

Common Mistakes:

• Swapping slow and fast initialization incorrectly
• Changing pointer movement speeds
• Returning fast pointer value without logic