From 918fa8bb8ae1f052921fffd188d229d4713c73c9 Mon Sep 17 00:00:00 2001
From: 1227haran <68032825+1227haran@users.noreply.github.com>
Date: Wed, 2 Oct 2024 23:37:07 +0530
Subject: [PATCH] Optimized O(n) to O(1) (#11669)

---
 data_structures/linked_list/has_loop.py | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/data_structures/linked_list/has_loop.py b/data_structures/linked_list/has_loop.py
index bc06ffe150e8..f49e01579adc 100644
--- 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