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 →
webcoderspeed.com
1276 articles
Merge all nodes between 0s into a single node with their sum, modifying the list in-place.
Delete the middle node of a linked list using a prev-pointer variant of the fast/slow technique.
Reverse nodes in each even-length group of a linked list by counting group sizes and selectively reversing.
Insert a value into a sorted circular linked list by finding the correct position with careful edge case handling.
Count the number of connected components of a linked list that consist of nodes in a given set.