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?

Looks like someone messed up the running code?

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;
    }

Is something wrong with the tests? no solution is working here and this is a little awkward..

A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return . Otherwise, return .

Example

refers to the list of nodes

The numbers shown are the node numbers, not their data values. There is no cycle in this list so return .

refers to the list of nodes

There is a cycle where node 3 points back to node 1, so return .

Function Description

Complete the has_cycle function in the editor below.

It has the following parameter:

SinglyLinkedListNode pointer head: a reference to the head of the list Returns

int: if there is a cycle or if there is not