Given the head of a linked list, remove the n-th node from the end of the list and return its head.
head
n-th
Input: head = [1,2,3,4,5], n = 2 Output: [1,2,3,5]
Input: head = [1], n = 1 Output: []
sz
1 <= sz <= 30
0 <= Node.val <= 100
1 <= n <= sz
Run code to see results