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.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.