Optimize has_loop using Floyd's cycle detection

Refactored has_loop method to use the Floyd's cycle-finding algorithm for detecting loops in a linked list.

Author: Aarya1777

data_structures/linked_list/has_loop.py

@@ -37,11 +37,17 @@ def has_loop(self) -> bool:
         >>> root_node.has_loop
         True
         """
-        try:
-            list(self)
-            return False
-        except ContainsLoopError:
-            return True
+        slow = self
+        fast = self
+
+        while fast is not None and fast.next_node is not None:
+            slow = slow.next_node
+            fast = fast.next_node.next_node
+
+            if slow is fast:
+                return True
+
+        return False
 
 
 if __name__ == "__main__":