Why Detect Cycle in Linked List Floyd's Algorithm in DSA C++?

The Big Idea

What if your program gets stuck forever without you knowing? Floyd's Algorithm saves you from that trap!

The Scenario

Imagine you have a long chain of paper clips linked together. Sometimes, by mistake, one paper clip links back to an earlier one, creating a loop. If you try to count the clips by moving from one to the next, you might get stuck going around forever without knowing it.

The Problem

Manually checking if the chain loops back is slow and confusing. You might keep counting clips endlessly or miss the loop entirely. It's easy to get lost or make mistakes, especially if the chain is very long.

The Solution

Floyd's Algorithm uses two pointers moving at different speeds to quickly detect if a loop exists. If there is a cycle, the faster pointer will eventually catch up to the slower one, proving the loop without checking every link manually.

Before vs After

✗ Before

Node* current = head;
while (current != nullptr) {
  // No easy way to detect loop
  current = current->next;
}

✓ After

Node* slow = head;
Node* fast = head;
while (fast && fast->next) {
  slow = slow->next;
  fast = fast->next->next;
  if (slow == fast) return true;
}
return false;

What It Enables

This method lets you quickly and reliably find loops in linked lists, preventing endless loops and errors in programs.

Real Life Example

In social media apps, user connections can form loops. Detecting these loops helps avoid infinite friend suggestions or repeated notifications.

Key Takeaways

Manual loop detection is slow and error-prone.

Floyd's Algorithm uses two pointers moving at different speeds.

It detects cycles efficiently without extra memory.

Practice

1. What is the main purpose of Floyd's Cycle Detection Algorithm in a linked list?

easy

A. To find the middle element of the linked list

B. To sort the linked list in ascending order

C. To reverse the linked list

D. To detect if there is a cycle (loop) in the linked list

Solution

1. Step 1: Understand Floyd's Algorithm goal

   Floyd's Cycle Detection Algorithm is designed to check if a linked list contains a cycle, meaning a node points back to a previous node.

2. Step 2: Compare with other linked list operations

   Sorting, reversing, or finding the middle element are different operations and not the purpose of this algorithm.

3. Final Answer:

   To detect if there is a cycle (loop) in the linked list -> Option D

4. Quick Check:

   Cycle detection = Detect cycle [OK]

Hint: Floyd's algorithm finds loops, not sorting or reversing [OK]

Common Mistakes:

• Confusing cycle detection with sorting
• Thinking it finds the middle node
• Assuming it reverses the list

2. Which of the following correctly initializes the two pointers used in Floyd's Cycle Detection Algorithm in C++?

easy

A. ListNode* slow = head; ListNode* fast = head;

B. ListNode* slow = head->next; ListNode* fast = head;

C. ListNode* slow = nullptr; ListNode* fast = head;

D. ListNode* slow = head; ListNode* fast = head->next;

Solution

1. Step 1: Understand pointer initialization in Floyd's algorithm

   Both slow and fast pointers start at the head node to begin traversal.

2. Step 2: Check each option

   ListNode* slow = head; ListNode* fast = head; initializes both pointers at head, which is the standard approach. Other options start pointers differently, which can cause errors or miss cycles.

3. Final Answer:

   ListNode* slow = head; ListNode* fast = head; -> Option A

4. Quick Check:

   Both pointers start at head [OK]

Hint: Start both pointers at head for Floyd's algorithm [OK]

Common Mistakes:

• Starting fast pointer at head->next causes skipping
• Initializing slow as nullptr causes null errors
• Swapping slow and fast initialization

3. What will be the output of the following code snippet detecting a cycle in a linked list?

#include <iostream>

struct Node {
  int data;
  Node* next;
};

bool hasCycle(Node* head) {
  Node* slow = head;
  Node* fast = head;
  while (fast && fast->next) {
    slow = slow->next;
    fast = fast->next->next;
    if (slow == fast) return true;
  }
  return false;
}

int main() {
  Node a{1, nullptr};
  Node b{2, nullptr};
  Node c{3, nullptr};
  a.next = &b;
  b.next = &c;
  c.next = &b; // cycle here
  bool result = hasCycle(&a);
  std::cout << (result ? "Cycle detected" : "No cycle") << std::endl;
  return 0;
}

medium

A. No cycle

B. Cycle detected

C. Compilation error

D. Runtime error

Solution

1. Step 1: Analyze linked list structure

   Nodes a, b, c are linked as a->b->c, and c points back to b, creating a cycle.

2. Step 2: Trace Floyd's algorithm behavior

   Slow and fast pointers will eventually meet inside the cycle, so hasCycle returns true.

3. Final Answer:

   Cycle detected -> Option B

4. Quick Check:

   Cycle exists, so output is "Cycle detected" [OK]

Hint: If a node points back, Floyd detects cycle [OK]

Common Mistakes:

• Ignoring the cycle created by c.next = &b
• Assuming no cycle because list looks linear
• Confusing output with compilation or runtime errors

4. Identify the bug in this Floyd's Cycle Detection code snippet:

bool detectCycle(Node* head) {
  Node* slow = head;
  Node* fast = head;
  while (fast->next && fast->next->next) {
    slow = slow->next;
    fast = fast->next->next;
    if (slow == fast) return true;
  }
  return false;
}

medium

A. The return type should be void, not bool

B. Pointers slow and fast should start at different nodes

C. The while condition should check if fast is not nullptr before fast->next

D. The comparison if (slow == fast) should be outside the loop

Solution

1. Step 1: Check while loop condition safety

   The code checks fast->next and fast->next->next but does not check if fast itself is nullptr, risking null pointer access.

2. Step 2: Correct condition order

   Proper check is to ensure fast is not nullptr before accessing fast->next to avoid runtime errors.

3. Final Answer:

   The while condition should check if fast is not nullptr before fast->next -> Option C

4. Quick Check:

   Check fast != nullptr before fast->next [OK]

Hint: Always check pointer not null before accessing members [OK]

Common Mistakes:

• Skipping null check on fast pointer
• Starting pointers at different nodes unnecessarily
• Moving comparison outside loop causing infinite loop

5. Given a linked list where a cycle exists, how can Floyd's algorithm be extended to find the exact node where the cycle begins?

hard

A. After detecting the cycle, reset one pointer to head and move both pointers one step at a time until they meet at the cycle start.

B. Count the number of nodes in the list and divide by two to find the cycle start.

C. Use a hash set to store visited nodes and find the first repeated node.

D. Reverse the linked list and check where the reversal breaks to find the cycle start.

Solution

1. Step 1: Detect cycle using Floyd's algorithm

   First, detect the cycle by moving slow and fast pointers until they meet inside the cycle.

2. Step 2: Find cycle start node

   Reset one pointer to head, then move both pointers one step at a time; their meeting point is the cycle start node.

3. Final Answer:

   After detecting the cycle, reset one pointer to head and move both pointers one step at a time until they meet at the cycle start. -> Option A

4. Quick Check:

   Reset pointer + move stepwise = cycle start [OK]

Hint: Reset pointer to head after detection, move both stepwise [OK]

Common Mistakes:

• Trying to find cycle start by counting nodes
• Using extra memory like hash sets (not Floyd's method)
• Reversing list which breaks structure