• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

Circular | Linked List | Question 5

Consider a small circular linked list. How to detect the presence of cycles in this list effectively?

(A)

Keep one node as head and traverse another temp node till the end to check if its ‘next points to head

(B)

Have fast and slow pointers with the fast pointer advancing two nodes at a time and slow pointer advancing by one node at a time

(C)

Cannot determine, you have to pre-define if the list contains cycles

(D)

Circular linked list itself represents a cycle. So no new cycles cannot be generated

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments