We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Linked Lists
  4. Cycle Detection
  5. Discussions

Cycle Detection

Sort by

recency

|

1354 Discussions

|

  • vedansh_shetty
     + 0 comments

    This was very frustrating 

     C++ 20  DOES NOT HAVE  the proper boiler plate code setup for this problem.

    I had to use C++14

    why did you have to do this to me hackerrank T-T

  • johntorian
     + 0 comments

    I assumed you had to preserve the integrity of the data in the list, I did this as a joke lol

    def has_cycle(head):
    if head is None: 
        return 0
    
    while(True):
        if head.data == "foo": 
            return 1
        
        if head.next is None:
            return 0
        head.data ="foo"
        head = head.next

    Though replace foo with something cruder...

  • danielcirnaru1
     + 0 comments

    Isn't this part badly written?

    "head refers to the list of nodes 1 -> 2 -> 3 -> 1 -> NULL There is a cycle where node 3 points back to node 1, so return 1."

    It says there is a cycle but from 1 it points to NULL,shouldnt instead return to the first value ,as in photos?

  • jaiversin
     + 1 comment

    Looks like someone messed up the running code?

  • mdsanz
     + 0 comments

    My Java 8 Solution

    static boolean hasCycle(SinglyLinkedListNode head) {
        if (head == null) {
            return false;
        }
        
        SinglyLinkedListNode slow = head;
        SinglyLinkedListNode fast = head;
        
        while (fast != null && fast.next != null) {
            slow = slow.next;
            fast = fast.next.next;
            
            if (slow.equals(fast)) {
                return true;
            }
        }
        
        return false;
    }