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.
The first line of input contains the number of testcase T. For each testcase, the first line of input contains the number of nodes in the linked list and the number N. The next line contains N nodes of the linked list.
For each testcase, output the data of node which is at Nth distance from the end or -1 in case node doesn't exist.
The task is to complete the function getNthFromLast() which takes two arguments: reference to head and N and you need to return Nth from the end.
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(1).
1 <= T <= 200
1 <= L <= 103
1 <= N <= 103
1 2 3 4 5 6 7 8 9
10 5 100 5
Testcase 1: 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.
Testcase 2: 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.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.