We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
def has_cycle(head):
nodes=set()
if head==None:
return 0
while head!=None and head.next:
if head in nodes:
return 1
else:
nodes.add(head)
if head.next.next!=None:
head=head.next
else:
if head.next in nodes:
return 1
else: return 0
return 0
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Cycle Detection
You are viewing a single comment's thread. Return to all comments →
Python Solution
def has_cycle(head): nodes=set() if head==None: return 0 while head!=None and head.next: if head in nodes: return 1 else: nodes.add(head) if head.next.next!=None: head=head.next else: if head.next in nodes: return 1 else: return 0 return 0