Solution: Remove Nth Node from End of List

Statement

Given the head of a singly linked list, remove the $n^{th}$ node from the end of the list and return its head.

Constraints:

• The number of nodes in the list is k.
• $1 \leq$ k $\leq 10^3$
• $-10^3 \le$

...