|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Delete a node from BST|
|K’th smallest element|
|Detect cycle in a directed graph|
|Element with left side smaller and right side greater|
|Sort The Array|
|Level order traversal Line by Line|
|Add two numbers represented by linked lists|
|Root to leaf path sum|
Given a singly linked list with n nodes, find node at a given index of linked list.
You have to complete the method which takes one argument: the head of the linked list. You should not read any input from stdin/console.
The struct Node has a data part which stores the data and a next pointer which points to the next element of the linked list.
There are multiple test cases. For each test case, this method will be called individually.
Your function should return data of N'th node.
1 <=T<= 30
1 <=N<= 100
K <= N
1 <=value<= 1000
1 2 3 4 657 76
8 7 10 8 6 1 20 91 21 2