dsa2 min read
Merge Two Sorted Lists — Dummy Head Merge
Merge two sorted linked lists into one sorted list using a dummy head node to simplify pointer management.
Read →
Dummy-head
6 articles
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 →
dsa1 min read
Add Two Numbers — Simulate Carry with Dummy Head
Add two numbers represented as reversed linked lists by simulating digit addition with carry propagation.
Read →
dsa1 min read
Partition List — Two Dummy Head Chains
Partition a linked list around value x into less-than and greater-than-or-equal chains, then join them.
Read →
dsa1 min read
Remove All Duplicates from Sorted List II — Dummy + Skip
Remove all nodes that have duplicate numbers from a sorted linked list using a dummy head and skip logic.
Read →