#41 Easy Time O(n) Space O(1) Animated

Linked List Cycle

Detect if a linked list has a cycle using Floyd's algorithm.

LeetCode ↗

Approach: Floyd's Tortoise and Hare

Click play to start

Step 0 / 0

Press play to start the visualization.

1×

Description

Detect if a linked list has a cycle using Floyd's algorithm.

Constraints

Time Complexity: O(n)
Space Complexity: O(1)

Solution — Floyd's Tortoise and Hare

O(n) O(1)

def hasCycle(head):
    slow, fast = head, head
    
    while fast and fast.next:
        slow = slow.next
        fast = fast.next.next
        if slow == fast:
            return True
            
    return False

Add Two Numbers

Find the Duplicate Number

Linked List Cycle

Steps

Description

Constraints

Tags

Solution — Floyd's Tortoise and Hare