What is the two-pass brute-force approach?

Question

What is the two-pass brute-force approach?

Option A — Correct answer

Count nodes, then walk again to the middle

Option B

Use a min heap

Option C

Run DFS

Option D

Sort the linked list

Explanation

Count nodes, then walk again to the middle index.

Middle of the Linked List - Fast and slow pointers Pattern Practice Quiz