Floyd’s Cycle Detection Algorithm

[Anshuman7080]

Use of Floyd's Cycle Detection:

The detectLoop function now uses two pointers (slow and fast). The slow pointer moves one step at a time, while the fast pointer moves two steps. If there is a loop, the two pointers will eventually meet.
Constant Space Complexity:

This algorithm uses no extra space, thus achieving
𝑂
(
1
)
O(1) space complexity compared to the
𝑂
(
𝑛
)
O(n) space used in the previous approach with a hash set.
Early Exit:

The function checks if the head is nullptr right away, allowing for an early exit if the list is empty.
This implementation is not only efficient but also straightforward and easy to understand, making it a great choice for detecting loops in linked lists.