Given the head of a linked list, remove the nth node from the end of the list and return its head.
Example 1:
Input: head = [1,2,3,4,5], n = 2
Output: [1,2,3,5]Example 2:
Input: head = [1], n = 1
Output: []Example 3:
Input: head = [1,2], n = 1
Output: [1]As always, follow the comments for each line.
In this solution, the time complexity is O(n) since we are going through Linked List only once. And space complexity is O(1) because we are only using the 2 nodes for a whole linked list.
From my comments on the code, if you have any questions or comments, feel free to reach out.
