Given the
head of a linked list, remove the nth node from the end of the list and return its head.Example 1:

Example 2:
Example 3:
Constraints:
- The number of nodes in the list is
sz.
1 <= sz <= 30
0 <= Node.val <= 100
1 <= n <= sz