Given a linked list consisting of L nodes and given a number N. The task is to find the Nth node from the end of the linked list.
N = 2
Explanation: In the first example, there
are 9 nodes in linked list and we need
to find 2nd node from end. 2nd node
from end os 8.
N = 5
Explanation: In the second example, there
are 4 nodes in the linked list and we
need to find 5th from the end. Since 'n'
is more than the number of nodes in the
linked list, the output is -1.
The task is to complete the function getNthFromLast() which takes two arguments: reference to head and N and you need to return Nthfrom the end or -1 in case node doesn't exist..
Try to solve in single traversal.
Expected Time Complexity: O(N). Expected Auxiliary Space: O(1).