Is your feature request related to a problem? Please describe.
It is used to solve Floyd’s cycle finding algorithm .It uses two pointers one moving twice as fast as the other one. The faster one is called the faster pointer and the other one is called the slow pointer.
Describe the solution you'd like.
Hare & Tortoise algorithm is a pointer algorithm that uses two pointers which move through the array (or sequence/LinkedList) at different speeds.
Describe alternatives you've considered.
No
Add any other context or screenshots about the feature request here.
Is your feature request related to a problem? Please describe.
It is used to solve Floyd’s cycle finding algorithm .It uses two pointers one moving twice as fast as the other one. The faster one is called the faster pointer and the other one is called the slow pointer.
Describe the solution you'd like.
Hare & Tortoise algorithm is a pointer algorithm that uses two pointers which move through the array (or sequence/LinkedList) at different speeds.
Describe alternatives you've considered.
No
Add any other context or screenshots about the feature request here.
No response