In this question, we have to find kth node from end or n-k th from start. So, why can’t I simply jump (n-k) times from head. What is the need of runner technique?
DIfferent Approach
@raikunal251297 Your solution will also work but the runner technique would take less time if compared. See in your approach, first you need to traverse the whole linked list to find its length. Then you will have to traverse again to reach (length-k)th node.But by using runner technique you can reach length-kth node only by one traversal.
Hope this helps 