Given a linked list, remove the nth node from the end of list and return its head.
Given linked list:
n = 2.
After removing the second node from the end, the linked list becomes
* If n is greater than the size of the list, remove the first node of the list.
Try doing it using constant additional space.