Given the head of a singly linked list, remove the nthn^{th}nth node from the end of the list and return the head of the modified list.
head
Note: Could you solve this in a single pass through the list?
Constraints:
The number of nodes in the list is sz
sz
1≤1 \leq1≤ sz ≤30\leq 30 ...