105. Detect Cycle in a Linked List

Easy

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: head = [3,2,0,-4], pos = 1

Output: true

Explanation: The linked list has a cycle, where the tail connects to the second node (index 1).

Example 2:

Input: head = [1,2], pos = 0

Output: true

Explanation: The linked list has a cycle, where the tail connects to the first node (index 0).

Example 3:

Input: head = [1], pos = -1

Output: false

Explanation: The linked list has no cycle.

Constraints:

•
•
•

Time Complexity

O(n)

Space Complexity

O(1)

105. Detect Cycle in a Linked List

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

105. Detect Cycle in a Linked List

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases