solved linked-list-cycle

Author: SamTheKorean

linked-list-cycle/SamTheKorean.py

@@ -0,0 +1,15 @@
+# Time complexity : O(n)
+# Space complexity : O(1)
+class Solution:
+    def hasCycle(self, head: Optional[ListNode]) -> bool:
+        slow = head
+        fast = head
+
+        # check fast and fast.next are not the last node to ensure we can access fast.next.next
+        while fast and fast.next:
+            slow = slow.next
+            fast = fast.next.next
+            if slow == fast:
+                return True
+
+        return False