Linked List

Linked Lists store linear collections of data using pointers rather than contiguous memory allocation.

---

Key Operations and Patterns

1. Dummy Head Technique: Avoids null edge cases when modifying the head node.
2. In-place Reversal: Changing pointers iteratively or recursively without extra allocation.
3. Fast and Slow Pointer: Finding the middle element, cycle detection, or $N$-th node from the end.

---

Solved Problems

• 0206 - Reverse Linked List
• 0146 - LRU Cache