dsa2 min read
Linked List Cycle II — Floyd's Cycle Start Detection
Find the node where a cycle begins using Floyd's algorithm: detect meeting point, then reset one pointer to head.
Read →
All Posts
1575 articles
dsa1 min read
Find the Duplicate Number — Floyd's on Array as Linked List
Find the duplicate in an array of n+1 integers in O(1) space by treating indices as a linked list with Floyd's cycle detection.
Read →
dsa1 min read
Next Greater Node in Linked List — Monotonic Stack
Find the next greater value for each node in a linked list using a monotonic decreasing stack of indices.
Read →
dsa1 min read
Design Linked List — Sentinel Doubly Linked List
Implement a doubly linked list with sentinel head and tail nodes for clean O(1) insertions and deletions.
Read →
dsa1 min read
Swapping Nodes in a Linked List — Find Kth from Front and Back
Swap the kth node from the front with the kth node from the end by finding both with two pointers.
Read →
Page 140 of 315