Delete Middle Node

Problem

Delete the middle node from a singly linked list.

The middle is the node at zero-based index n // 2. A single-node list becomes empty and an empty list stays empty.

Return the remaining values as a new list.

Hint

Find the middle with slow and fast pointers, or simply compute n // 2.

case 1

in: [[1,2,3,4,5]]

expected: [1,2,4,5]

case 2

in: [[1,2,3,4]]

expected: [1,2,4]

case 3

in: [[1]]

expected: []

case 4

in: [[]]

expected: []

Starter codePython

def delete_middle(values):
    # Your code here
    pass

4 test cases · run your code against them in the editor