K-th element from end of linked list.
Sigiloso
again a standard question, to which I answered with naive approach and stack based approach, but they also asked me about a solution without any extra memory and in just one traversal of linked list. The solution used recursion and they gave me this hint, but yet I wasn't able to think of it there.