Remove the "N^th from the end" Node from a Singly-Linked List

Given a singly-linked list, remove its N^th from the end node.

Examples:
1->2->3->4->5, n=3 ==> 1->2->4->5
1->2->3->4->5, n=1 ==> 1->2->3->4
1->2->3->4->5, n=5 ==> 2->3->4->5

Need a hand? Try out these hints, one at a time.

Quick hint to get things rolling

This could be done in two passes with a single pointer or a single pass with two pointers.

Final hint! You should be able to code the problem on viewing this.

1. Find length of the List.

2. Use length-n+1 to find n^th node from the end.

3. Traverse the List to find the n^th from the end node and remove it. Removal can be done by pointing the Previous node's next reference to Current node's next reference.

public ListNode removeNthFromEnd(ListNode head, int n) {
       






}

This Coding Interview Question is available with an answer in the following programming languages :

Java

Python

Remove the "Nth from the end" Node from a Singly-Linked List

Quick hint to get things rolling

Final hint! You should be able to code the problem on viewing this.

The interview prep tool you'll fall in love with!

This Coding Interview Question is available with an answer in the following programming languages :

Remove the "N^th from the end" Node from a Singly-Linked List