remove_nth_node_from_end_of_list

README

< Previous 　　　　　　　　　　　　　　　　 Next >

19. Remove Nth Node From End of List (Medium)

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

Example:

Given linked list: 1->2->3->4->5, and n = 2.

After removing the second node from the end, the linked list becomes 1->2->3->5.

Note:

Given n will always be valid.

Follow up:

Could you do this in one pass?

Related Topics

[Linked List] [Two Pointers]

Hints

Hint 1

Maintain two pointers and update one with a delay of n steps.