What do you expect if you don't know even the most foundational terma in CS? There is only so much spoonfeeding possible. We don't explain what every English word in the description means, for example.

Also, there is a thing called Google. Use it.

@FArekkusu
Adam is right this makes no sense. I still have no idea what to do. Heck I've never even heard of nodes in Python!

In any algorithm you choose there's a "compare 2 nodes for identity" part. You must be doing something wrong if all the nodes are identical for you.

Are you sure you're moving through the linked list correctly? If you are indeed stuck in place, you'll be comparing the node with itself, hence "they are identical".

All nodes are different as all nodes are instantiated independently. If you don't want to search for the specific (classic) algorithm, you can simply go with a "store the nodes somewhere and check if I've encountered any of them already" approach (at least it worked for me in Python).

This is as much as I can tell without spoiling anything.

Being unfamiliar with something != something is mysterious and can't be understood. This kata is very simple OOP + the simplest data structure; ideally you must be familiar with both, especially when you're doing a task which includes these concepts.