dsa1 min read
Remove Duplicates from Sorted List — Single Pass
Remove duplicate nodes from a sorted linked list in O(n) with a single pointer walk.
Read →
Pointer-walk
5 articles
dsa2 min read
Rotate List — Find Length and Reconnect
Rotate a linked list to the right by k places by finding length, computing effective rotation, and rewiring.
Read →
dsa2 min read
Split Linked List in Parts — Even Distribution
Split a linked list into k consecutive parts as evenly as possible, front parts get the extra nodes.
Read →
dsa1 min read
Merge Nodes In Between Zeros — Pointer Walk
Merge all nodes between 0s into a single node with their sum, modifying the list in-place.
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 →