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.
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.
Example 1
Input: head = [1,2,3,4,5], n = 2 Output: [1,2,3,5]
Example 2
Input: head = [1], n = 1 Output: []
Show hint
Use two pointers: move first pointer n steps ahead, then move both pointers until first reaches end. Remove node at second pointer.
Sign in to submit, save progress and mark problems as solved. You can still run your code.
Loading editor...
head =
[1,2,3,4,5]
n =
2
Expected
[1,2,3,5]