educative.io

Slow, fast pointers not really necessary in the O(n) solution

In the more efficient vesion of the solution, when keeping tabs of visited indices, it is simpler to look for cycles by looping until returning to a visited node.

Can you describe with an example?

Are you talking about alternate approach?