You are given the head of a singly linked list and an integer n. Your task is to remove the nth node from the end of the linked list and return the head of the updated linked list.
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. After removing it, the linked list becomes 1 ? 2 ? 3 ? 5.
Example 2
Input: head = [1], n = 1
Output: []
Explanation: The only node is removed, resulting in an empty linked list.
Example 3
Input: head = [1,2], n = 1
Output: [1]
Explanation: The last node is removed, leaving the linked list as 1.
Sign in to write, run, and submit your solution against the full test suite.