Linked-List-Cycle-Detection.cpp

class Solution {
public:
    bool hasCycle(ListNode *head) {
        ListNode *fast = head;
        ListNode *slow = head;

        while(fast!=NULL && fast->next!=NULL){
            slow = slow->next;
            fast = fast->next->next;
             if(fast==slow){
                return true;
            }
        }
        return false;
    }
};