Topics / Linked Lists
🔗
Linked Lists
Pointer-driven data structures — singly, doubly, cycles, reversal, and the slow/fast trick.
Why learn Linked Lists?
-
Forces you to think in pointers — a transferable mental skill.
-
Many "famous" interview problems are linked-list problems in disguise.
-
Slow/fast pointers solve a whole family of problems.
What you can build with Linked Lists
Cycle detection (Floyd's tortoise and hare) Reverse / merge / rearrange patterns LRU cache implementations
Linked Lists tutorials
3 articlesHand-written tutorials, ordered as a recommended learning path.
- 01 Linked Lists — Intro A practical introduction to linked lists — what a node is, singly vs doubly linked, head and tail, how arrays and linked lists differ, and a clean Python implementation you can build on.
- 02 LL Operations The core operations every linked list problem builds on — inserting at head/tail/middle, deleting by value, reversing iteratively and recursively, finding the middle, and detecting a cycle.
- 03 LL — Practice Eight classic linked-list interview problems — reverse, detect cycle, merge sorted lists, remove Nth from end, cycle start, palindrome, add two numbers, and intersection — each with a worked Python solution.