FunctionRacerProblemsRace

Delete the Middle Node

MediumLinked listsPython, JavaScript, TypeScript, Java, C++

Remove the middle node and return the head. For a list of n nodes the middle is the node at index n // 2 (the head is index 0), so a list of 4 loses its 3rd node. A one-node list becomes empty. The list is passed in as head.

Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.

Example 1

head [1,2,3,4,5]
returns [1,2,4,5]

Index 2 holds 3.

Example 2

head [1,2,3,4]
returns [1,2,4]

Index 2 holds 3.

Constraints

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More Linked lists problems