🔗 JavaScript Linked List — Topic Index
A linked list is a linear data structure where each element (node) holds a value and a reference to the next node. JavaScript doesn't have a built-in linked list, so we implement it with classes.
Topics Covered
| # | Topic | Key Concepts |
|---|---|---|
| 1 | Basics | Node class, SLL, DLL, traversal |
| 2 | Operations | Reverse, merge, cycle detection |
| 3 | Interview Questions | 25 classic problems |
Why Linked Lists?
- Dynamic size — no fixed allocation
- O(1) insert/delete — at a known position
- Foundation for stacks, queues, LRU cache, adjacency lists
Common Patterns
- Two pointers (slow/fast) — cycle detection, middle, kth from end
- Dummy head — eliminates edge-case null checks
- Reverse in place — prev/curr/next swap loop
- Divide & Conquer — merge sort on linked list