dsa1 min read
Remove Zero Sum Consecutive Nodes — Prefix Sum Map
Remove consecutive nodes that sum to zero by tracking prefix sums in a map and relinking past zero-sum runs.
Read →
All Posts
1575 articles
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 →
dsa2 min read
Reverse Linked List II — In-Place Partial Reversal
Reverse the portion of a linked list between positions left and right in one pass using careful pointer manipulation.
Read →
dsa2 min read
Maximum Twin Sum of a Linked List — Split and Reverse
Find the maximum sum of twin nodes (node i + node n-1-i) by reversing the second half and comparing pairs.
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 →
Page 141 of 315