problem Implement an algorithm to find the kth to last element of a singly linked list how to solve We use two pointers slow-pointer and fast-pointer. Firstly we proceed the fast-pointer in k step. Secondly, we move them at the same pace a…
Login to quote this blog
Failed to save quote. Please try again later.
You cannot quote because this article is private.