Remove Nth Node From End of List

Given the head of a linked list, remove the n-th node from the end of the list and return its head.

---

Example 1

1 -> 2 -> 3 -> 4 -> 5 -> null
                ^
           remove 2nd from end (node 4)

1 -> 2 -> 3 -> 5 -> null

Input: head = [1, 2, 3, 4, 5], n = 2
Output: [1, 2, 3, 5]
Explanation: The 2nd node from the end is node 4; removing it links node 3 directly to node 5.

Example 2

Input: head = [1], n = 1
Output: []
Explanation: The only node is also the 1st from the end; removing it leaves an empty list.

---

Constraints

• The number of nodes in the list is sz.
• 1 <= sz <= 30
• 0 <= Node.val <= 100
• 1 <= n <= sz