It's a pointer algorithm that involves two pointers that move through the Array or LinkedList at different speeds. It's also known as Hare and Tortoise algorithm. The algorithm proves that the two pointers are bound to meet in case there is a cycle i...
Markdown supported · ⌘↵ to post
No responses yet.