2095. Delete the Middle Node of a Linked List

Singly-linked list. Delete the middle node (index ⌊n/2⌋, 0-indexed) and return the head; if there's a single node, return an empty list. Find the middle with slow/fast pointers, keeping a prev…