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):
address = set()
current = head
while current:
if current in address:
return 1
else:
address.add(current)
current = current.next
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 →
using hash
def has_cycle(head): address = set() current = head while current: if current in address: return 1 else: address.add(current) current = current.next return 0