Optimized O(n) to O(1) (#11669)

TheAlgorithms · Oct 2, 2024 · 918fa8b · 918fa8b
1 parent 00e9d86
commit 918fa8b
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/data_structures/linked_list/has_loop.py b/data_structures/linked_list/has_loop.py
@@ -14,11 +14,11 @@ def __init__(self, data: Any) -> None:
 
     def __iter__(self):
         node = self
-        visited = []
+        visited = set()
         while node:
             if node in visited:
                 raise ContainsLoopError
-            visited.append(node)
+            visited.add(node)
             yield node.data
             node = node.next_node