Can i have the implementation for this solution

#1

nth node from end in liked list

#2

@kishoretaru sorry for the delay due to some tech fault i was not able to see the doubt.
Try using slow and fast pointer . move the fast to k steps ahead. then move both one by one until fast reaches end. after that slow will be the ans. try using this approach. will provide you with a reference code if facing issue

#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.