Context

Linked lists are a common interview data structure because they test pointer manipulation, traversal logic, and space-efficient updates. Interviewers usually want to see whether you can reason carefully about references rather than rely on array indexing.

Core Question

Explain how you would use linked lists in a coding problem. In your answer, cover:

1. What a linked list is and how it differs from an array.
2. The common operations and patterns used in linked list problems, such as traversal, insertion, deletion, reversal, and cycle detection.
3. How you decide when a linked list is the right data structure and what pitfalls to avoid.

Scope Guidance

You do not need to implement a full linked list class unless asked. Focus on how linked lists are represented in interview problems, how pointer updates work, and which techniques—especially dummy nodes, fast/slow pointers, and recursion or iteration—are most useful.