Delete the Middle Node
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
0 <= number of nodes <= 100-100 <= Node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Linked lists problems
- Evens Before OddsMedium
- Last One StandingMedium
- Length of the CycleMedium
- Maximum Twin SumMedium
- Move a Value to the EndMedium
- Odd Even Linked ListMedium
- Partition ListMedium
- Plus One Linked ListMedium