Linked List Kth Node from Last

#1

Can we do it by first finding the tail then traversing back till k times ??

#2

hi @ashwani225 how do you plan to go back in a singly linked list? there is no way to do so.

#3

By finding reverse then traversing to kth node??

#4

@ashwani225 yes you can do that

#5

which method will cost less time complexity??

#6

@ashwani225 I think the time complexity will be the same for both cases but the method given in video is more efficient because less steps are involved. You can try coding both of them for practicea and use the one you are more comfortable with.

#7

https://ide.codingblocks.com/s/247404 Is this correct for Kth node??

#8

@ashwani225 the code seems to be working for multiple inputs, if you want to be absolutely sure you can try submitting it in a challenge or derive a mathematical proof.