Given a linked list with n nodes. Find the kth element from last without computing the length of the linked list.
Input Format
First line contains space separated integers representing the node values of the linked list. The list ends when the input comes as ‘-1’. The next line contains a single integer k.
Constraints
n < 10^5
Output Format
Output a single line containing the node value at the kth element from last.
Sample Input
1 2 3 4 5 6 -1
3
Sample Output
4
code link: https://ide.codingblocks.com/s/292795
one test case is not passing