Find the N^th Node from the End - Linked List

Given a singly-linked list, implement the method that returns Nth node from the end of the list. You are allowed to use extra memory for this implementation.

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

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

Quick hint to get things rolling

Since we are allowed to use extra space, we could use a Hashtable to find the nth node from the end - or the 'length-n+1'th node.

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

1. Try using a Hashtable to store the position and the actual ListNodes as you iterate over them.

2. Use 'length-n+1' as the index.

3. Now that you have an index, look up the Hashtable with the index as the key and return the node.

public ListNode findNthNodeFromEnd(ListNode head, int n) {
                




    
}

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

Java

Python

Find the Nth Node from the End - 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 :

Find the N^th Node from the End - Linked List