dsa1 min read
Delete Node in a Linked List — Copy Next Value
Delete a node given only access to that node by copying the next node value and skipping the next node.
Read →
All Posts
1276 articles
dsa1 min read
Intersection of Two Linked Lists — Two Pointer Length Trick
Find the intersection node of two linked lists in O(n) O(1) by switching pointers at the end of each list.
Read →
dsa1 min read
Convert Binary Number in Linked List to Integer — Bit Shift
Convert a linked list representing a binary number to its integer value using left-shift accumulation.
Read →
dsa1 min read
Remove Linked List Elements — Dummy Head
Remove all nodes with a given value from a linked list using a dummy head to handle edge cases cleanly.
Read →
dsa1 min read
Remove Nth Node From End of List — Fast/Slow with Dummy
Remove the nth node from the end in one pass using two pointers offset by n steps and a dummy head.
Read →
Page 77 of 256