Find Loops in Linked Lists | Dataford Interview Questions

Finding loops in a linked list.

Represent the linked list with next_indices, where next_indices[i] gives the index of node i and -1 means the list ends. The head parameter gives the starting index, or -1 for an empty list. Return True if any node is reachable more than once by following next pointers; otherwise return False.

Implement has_cycle(next_indices, head).

Constraints

0 <= len(next_indices) <= 1000
Each next_indices[i] is either -1 or an integer from 0 through len(next_indices) - 1
head is -1 or an integer from 0 through len(next_indices) - 1
Only nodes reachable from head affect the result

Function Signature

def has_cycle(next_indices, head):

Your question is Find Loops in Linked Lists. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Finding loops in a linked list.

Implement has_cycle(next_indices, head).

Constraints

0 <= len(next_indices) <= 1000
Each next_indices[i] is either -1 or an integer from 0 through len(next_indices) - 1
head is -1 or an integer from 0 through len(next_indices) - 1
Only nodes reachable from head affect the result

Function Signature

def has_cycle(next_indices, head):

Your question is Find Loops in Linked Lists. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.