The intention behind the task is to solve it without hashing. However, some languages do not block this, and if you can use HashMap in your language to solve the challenge, good for you! But you will miss an opportunity to learn a nice algorithm :)

I don't understand the Hash part. Am I allowed to use a HashMap or not?

The fact that objects have no attributs does not mean that they do not differ in any way form each other. They are different nodes, and you can easily check if they are the same, or different node.

The fact that nodes have no readable property does not make the kata broken.

It's broken in php. $node->next() returns only the same object, which has nothing in it except the next method. Literally. What should I do with it if the objects don't even differ from each other in any way and it falls into an endless cycle?

  var_dump(get_object_vars($node));
  var_dump(serialize($node));
  $b = $node->getNext();
  var_dump(get_object_vars($b));
  var_dump(serialize($b));

array(0) {
}
string(33) "O:4:"Node":1:{s:7:"*next";r:1;}"
array(0) {
}
string(33) "O:4:"Node":1:{s:7:"*next";r:1;}"

i don't even know what this is about

find the answer was not too diffcult, solve the timeout problem was important! feel fun with this KATA

Al final lo hiciste po!

You shoul tell us the concept, because many of us are lost in this kata!

Hello, I need help. I use c++ and for self-checking I wrote the Node class with similar methods myself. The problem is that the tests are running correctly on my computer (when I type in test examples), but when I test the code here, it gives a completely different value. What could this be related to?

You don't need the nodes' values. They might not even have values.

It doesn't depend on using the node value. The values could all be identical. The nodes don't even need to store a value inside of them.

Anyone solved this Kata in php? I am struggling how to optain the value of a node.

Good question. I am struggling also with the node check.