Linked list
Overview
A linked list stores data in nodes where each node points to the next node.
Problems to practice
- Reverse linked list
- Detect cycle in linked list
- Merge two sorted linked lists
- Middle of the linked list
- Remove nth node from end
- Intersection of two linked lists
- Palindrome linked list
Patterns
- Dummy node
- Fast and slow pointers
- pointer rewiring
Interview guidance
Linked lists test pointer manipulation and careful handling of edge cases like nulls and cycles.
Can you explain it without the notes?
Linked list
Use your own words. Explain an example and one limitation before checking the explanation.
Check your explanation
What it is
Turn this concept into a clear answer.
Practice this conceptAdapted from 14_DSA_MASTER.md · “5. Linked list”. Examples are study fragments; framework behavior can depend on your version.