Remove Unicode

Author: nickolashkraus

src/linked_list_cycle.py

@@ -28,7 +28,7 @@ def hasCycle(self, head: ListNode | None) -> bool:
             return False
 
         # The algorithm maintains two pointers into the given sequence, one
-        # (the tortoise) at xᵢ, and the other (the hare) at x₂ᵢ. At each step
+        # (the tortoise) at xi, and the other (the hare) at x2i. At each step
         # of the algorithm, it increases i by one, moving the tortoise one step
         # forward and the hare two steps forward in the sequence, and then
         # compares the sequence values at these two pointers. The smallest