K-th Element from last in a linked List

#1

How to think of a solution of this question if we have to solve it without using the length of a LinkedList???

#2

@Anubhav44044,

Use the two pointers approach:

  1. Maintain two pointers – reference pointer and main pointer.
  2. Initialize both reference and main pointers to head.
  3. First move reference pointer to n nodes from head.
  4. Now move both pointers one by one until reference pointer reaches end.
  5. Now main pointer will point to nth node from the end.
  6. Return main pointer.
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.