Algo_ds_101: Check for a closed loop in linked lists

[dwij2212]

Submission Title
Check for closed loop using Floyd's cycle algorithm

Submission Type
Data Structure

Submission Description
Fastest algorithm to detect a closed loop in a linked list. We keep track of 2 pointers and traverse one a bit faster than the other. If these pointers meet again then there is a closed loop.

Submission Directory
algo_ds_101 => Data_Structures => LinkedList => detect_cycle.extension

Contributors

• [x] C++ -
• [ ] C -
• [x] Python -
• [ ] Java -
• [ ] JavaScript -
• [ ] TypeScript -
• [ ] Golang -
• [ ] Ruby -
• [ ] php -
• [ ] Swift -
• [ ] C# -

[github-actions[bot]]

👋 @${author}

Thanks for opening your first issue here! Be sure to follow the issue template!

Regards @ahampriyanshu :v:

[dwij2212]

Hi! Could you assign this issue to me in C++

[divyagupta-98]

Could you assign this issue to me in Python.

[ByteCode-Test]

PLEASE Assign this to me i'm good at it

[MohitBhagchandani0601]

I want to work on this issue in java😊

[dhairya-parikh]

Could you assign this issue to me in Java.

[Druffl3]

@ahampriyanshu can you assign this task to me for C# implementation?

[Suparna99]

Please assign me this for Ruby

[baniksudipto]

Please assign me this for Golang

[ahampriyanshu]

Could you assign this issue to me in Java.

Please opt a different language/issue.

[Pancreax]

Hi! I would like to work on this issue in Swift.

[matheuslmpereira]

@dwij2212 @ahampriyanshu Can I suggest to include kotlin language in the list?
I will pretty happy to make the implementation.

[maityankan10]

please assign this to me in C

[nishtha14-arora]

Hi, I want to solve this issue in java.

[ahampriyanshu]

thanks everyone :v: