Floyd Warshal Algorithm

Most usefull and easy way to find wheter linked list has a cycle or not

Let's Implement it using Java

 public boolean LinkedListHasCycle(ListNode head){
       ListNode slow = head;
       ListNode fast = head;

       while(slow != null && fast != null && fast.next != null){
        slow = slow.next;
        fast = fast.next.next;
        if(slow == fast){
            return true;
           }
       }
       return false;
    }

function linkedListHasCycle(head) {
    let slow = head;
    let fast = head;

    while (slow !== null && fast !== null && fast.next !== null) {
        slow = slow.next;
        fast = fast.next.next;
        if (slow === fast) {
            return true;
        }
    }
    return false;
}