DevLift

Blog

Tutorials, guides, and insights to help you become a better developer.

Clear
Reverse a Linked List — Iterative and Recursive
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.
AdminAugust 2, 20264 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.
AdminAugust 2, 20265 min read
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).
AdminAugust 2, 20265 min read

Stay in the Loop

Get notified about new courses, tutorials, and learning tips. No spam, unsubscribe anytime.