[Code Addition Request]: addition of linked list cycle detection algorithm

[SKG24]

Have you completed your first issue?

• [X] I have completed my first issue

Guidelines

• [X] I have read the guidelines
• [X] I have the link to my latest merged PR

Latest Merged PR Link

https://github.com/UTSAVS26/PyVerse/pull/891#event-14950590185

891

Project Description

Problem Statement:

Given the head of a linked list, determine if the list contains a cycle. A cycle occurs if a node in the list points back to a previous node, allowing traversal to loop indefinitely.

Solution Approach Using Slow and Fast Pointers:

To detect a cycle, we use two pointers, slow and fast, that traverse the list at different speeds:

• slow moves one step at a time, while fast moves two steps.
• If there is a cycle, fast will eventually "lap" slow, causing them to meet.
• If fast reaches the end of the list (NULL), there is no cycle.

This two-pointer technique efficiently detects cycles in O(n) time complexity without extra space.

Full Name

Sanat Kumar Gupta @skg24

Participant Role

gssoc-ext, hacktoberfest

[github-actions[bot]]

🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible.

Feel free to join our community on Discord to discuss more!

[SKG24]

please assign this to me! thank you!