{"date":"2026-06-15","link":"/problems/delete-the-middle-node-of-a-linked-list/","question":{"questionId":"2216","questionFrontendId":"2095","title":"Delete the Middle Node of a Linked List","titleSlug":"delete-the-middle-node-of-a-linked-list","translatedTitle":null,"difficulty":"Medium","acRate":60.36288758933922,"topicTags":[{"name":"Linked List","slug":"linked-list","nameTranslated":null},{"name":"Two Pointers","slug":"two-pointers","nameTranslated":null}],"content":"

You are given the head of a linked list. Delete the middle node, and return the head of the modified linked list.

\n\n

The middle node of a linked list of size n is the ⌊n / 2⌋th node from the start using 0-based indexing, where ⌊x⌋ denotes the largest integer less than or equal to x.

\n\n\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: head = [1,3,4,7,1,2,6]\nOutput: [1,3,4,1,2,6]\nExplanation:\nThe above figure represents the given linked list. The indices of the nodes are written below.\nSince n = 7, node 3 with value 7 is the middle node, which is marked in red.\nWe return the new list after removing this node. \n
\n\n

Example 2:

\n\"\"\n
\nInput: head = [1,2,3,4]\nOutput: [1,2,4]\nExplanation:\nThe above figure represents the given linked list.\nFor n = 4, node 2 with value 3 is the middle node, which is marked in red.\n
\n\n

Example 3:

\n\"\"\n
\nInput: head = [2,1]\nOutput: [2]\nExplanation:\nThe above figure represents the given linked list.\nFor n = 2, node 1 with value 1 is the middle node, which is marked in red.\nNode 0 with value 2 is the only node remaining after removing node 1.
\n\n

 

\n

Constraints:

\n\n\n"}}