dsa7 min read
Delete the Middle Node of a Linked List — Modified Fast/Slow Pointer Explained
Learn how to delete the middle node of a linked list in one pass using a clever modification of the fast/slow pointer technique. A LeetCode 75 problem asked at Amazon and Google that tests your understanding of the tortoise-and-hare algorithm.
Read →