Blog
Tutorials, guides, and insights to help you become a better developer.
Two mid-to-senior linked list problems that test data structure design: deep-copying a list with random pointers (O(1) space trick), and implementing LRU Cache in O(1).
AdminMarch 19, 20265 min read
Three linked list problems, one underlying playbook: dummy heads, divide-and-conquer merging, and the find-middle/reverse/interleave pipeline that makes LC 143 tractable.
AdminFebruary 6, 20265 min read
The three-pointer pattern is the foundation of every linked list reversal. Understand it once and LC 206, 92, and 25 become variations on the same idea.
AdminJanuary 27, 20264 min read