You are viewing a single comment's thread. Return to all comments →
def has_cycle(head): visited = set() while n:=head.next: if n in visited: return 1 else: visited.add(n) head = n return 0
Seems like cookies are disabled on this browser, please enable them to open this website
An unexpected error occurred. Please try reloading the page. If problem persists, please contact support@hackerrank.com
Cycle Detection
You are viewing a single comment's thread. Return to all comments →