Remove Nth Node From End of List

Remove Nth Node From End of List

Given the head of a linked list, remove the nth node from the end of the list and return its head.

Examples

Example 1:

Input: head = [1, 2, 3, 4, 5], n = 2
Output: [1, 2, 3, 5]
Explanation: The 2nd node from the end is 4, which is removed.

Example 2:

Input: head = [1], n = 1
Output: []

Example 3:

Input: head = [1, 2], n = 1
Output: [1]

Constraints

• The number of nodes in the list is sz.
• 1 <= sz <= 30
• 0 <= Node.val <= 100
• 1 <= n <= sz

Expected Complexity

• Time: O(sz)
• Space: O(1)