Here, while finding the kth node in the linked list, firstly we need to make the fast pointer to take k jumps, so it should also need a loop, thus it means that a total of 2 loops are implemented in this approach as well??
Doubt in the coding part
okay,
understood now,
thanks a lot!
1 Like
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.