Yes, you can find the length of such a linked list. A linked list that has a cycle is stuck in a loop, but it's possible for you to find out the length of such a linked list because the length of the linked list is the total number of distinct nodes in the linked list. First, you have to detect the cycle; then, you need to calculate the length of the cycle and the position at which it starts. The sum of these is the total number of distinct nodes in the list. The algorithm can be like taking two pointers, a slow pointer S and a fast pointer F. F advances two nodes when S advances one node. You keep traversing using the pointers until the F pointer reaches the same node as the S pointer. This is where the loop begins. Now you assume a counter with a value of 1 and start traversing S until it collides with F again; then, the value of the counter is equal to the length of the cycle and similarly find the length of the rest of the elements and add to get the length of the list.