Floyd's Cycle Detection

Why is the while loop do we have
while (fast!= NULL && fast->next != NULL) instead of
while (fast!= NULL || fast->next != NULL)?

Just take a case and check for that. Both conditions must be satistfied in order to move further.
Say fast reaches to the last node:
while (fast!= NULL || fast->next != NULL) will give an error. because NULL->next is invalid.

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.