dsa1 min read
Delete the Middle Node — Fast/Slow with Prev Pointer
Delete the middle node of a linked list using a prev-pointer variant of the fast/slow technique.
Read →
All Posts
1575 articles
dsa2 min read
Reverse Nodes in Even-Length Groups — Group Counting
Reverse nodes in each even-length group of a linked list by counting group sizes and selectively reversing.
Read →
dsa2 min read
Insert into a Sorted Circular List — Pointer Scan
Insert a value into a sorted circular linked list by finding the correct position with careful edge case handling.
Read →
dsa1 min read
Linked List Components — HashSet Membership Check
Count the number of connected components of a linked list that consist of nodes in a given set.
Read →
dsa2 min read
Flatten Binary Tree to Linked List — Morris Traversal
Flatten a binary tree in-place into a linked list following pre-order using the Morris traversal approach.
Read →
Page 142 of 315