dsa_competitive-coding
dsa_competitive-coding copied to clipboard
[GSSoC '23] | Cycle Detection in LinkedList
Task description : -
Given the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some node that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that the tail's next pointer is connected to. Just so you know, pos is not passed as a parameter.
Return true if there is a cycle in the linked list. Otherwise, return false.
Please assign this issue to me @aaryahjolia !!
Can you assigned this issue to me?
Can I have this issue, will make the full documentation with Question links from various platform, In detail explanation of Algorithm used.
For reference you can visit my profile I am trying to do daily Leetcoding, with my JOB.
Hi, I am Contributor for GSSOC'23. Can this issue be assigned to me. I will do the code section with proper documentation with markdown file. For markdown reference can visit my profile.
Regards, Vivek Kumar