🚀 POTD: Day 61
🔍 Detect Loop in Linked List ✨

Approach:
1️⃣ Use two-pointer (Floyd's cycle detection).
2️⃣ Move slow by 1 step, fast by 2 steps.
3️⃣ If they meet, a loop exists; otherwise, no loop.

Complexity: O(n) Time, O(1) Space
#POTDwithGFG
@geeksforgeeks
#POTDwithGFG