dsa1 min read
Middle of the Linked List — Fast and Slow Pointers
Find the middle node of a linked list in one pass using the slow/fast pointer technique.
Read →
All Posts
1276 articles
dsa1 min read
Linked List Cycle — Floyds Tortoise and Hare
Detect a cycle in a linked list in O(1) space using Floyd's two-pointer tortoise and hare algorithm.
Read →
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 →
dsa1 min read
Palindrome Linked List — Split, Reverse, Compare
Check if a linked list is a palindrome by finding the middle, reversing the second half, then comparing.
Read →
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 →
Page 76 of 256