Removal of cycle in a linked list

#1

after slow and fast meet 2nd time then how to reach to the prev element of fast pointer??

#2

Hello @S19LPPP0192,

You can do this in two ways:

  1. Either take a temporary pointer variable of type node to keep track of previous element.
    slow=head;
    node* prev=NULL;
    while(slow != prev) {
    slow=slow->next;
    prev=fast; // Track of previous node.
    fast=fast->next;
    }

  2. Without using temporary variable:
    slow=head;
    while(slow->next!=fast->next){
    slow=slow->next;
    fast=fast->next;
    }

Hope, this would help.
Give a like, if you are satisfied.

#3

May i know, if you have some doubt?
As you have reopened this doubt.

#4

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.