Part II · Linear Data Structures and Core Collections
11. Linked Lists
9 lessons•50 topics•Beginner / Intermediate
9 of 9 lessons published
11.011 animated
Node fundamentals
- Value and next pointer
- Head and tail
- Singly linked list
- Null termination
- Reference identity
11.027 animated
Singly linked operations
- Insert head
- Insert tail
- Insert at index
- Delete head/tail
- Delete by value
- Search
- Traverse
- Reverse
11.033 animated
Doubly linked lists
- Prev and next
- Insert/delete
- Head/tail sentinels
- Two-way traversal
- Additional pointer overhead
11.042 animated
Circular linked lists
- Singly circular
- Doubly circular
- Loop termination
- Circular queue implementation
- Josephus problem
11.056 animated
Fast/slow pointer
- Middle node
- Nth from end
- Floyd cycle detection
- Cycle entry
- Cycle length
- Palindrome linked list
11.065 animated
Reversal variants
- Full reverse
- Reverse recursively
- Reverse between indices
- Reverse in k-groups
- Reorder list
11.074 animated
Linked list merging
- Merge two sorted lists
- Merge k sorted lists
- Add two numbers
- Intersection of lists
- Deduplicate sorted lists
11.084 animated
Advanced manipulations
- Partition list
- Rotate list
- Swap pairs
- Flatten multi-level list
- Clone random-pointer list
- LRU node management
11.091 animated
Memory and implementation
- Java object references
- Dummy node
- Sentinel
- GC of unlinked nodes
- Array vs linked list trade-offs