hahahahahaha

kindly keep personal opinions to oneself. Remember this site is established for coding purposes and not for discussing political opinions.

nice kata - tho the surface area formula kinda tripped me

lol

Holy cow....

wha- why?

hey!

...

Your function gets the start node of a long chain of nodes. But somewhere this chain starts to loop. You should count and return the numbers of nodes that create the loop.

Just run your code and indeed it's just too slow. You'd have to find some more performant algorithm.

It would be also helpful if you used proper code formatting when posting code blocks :)

Resolving as not a kata issue.

I didnt have a chance to run your code, but just reading it it seems to have insufficient time complexity and is most probably too slow.
Expected approach is O(n) in time, and O(1) in space, while your solution seems to be O(n^2) in time and O(n) in space.

this guys a legend... sadly he had to be suspended

fix your kata

please make a python version... quite excited to try my hand on this!

Can anyone explain the terms of the assignment? It is more or less clear what should be at the output and it is not at all clear what is at the input. It is impossible to understand.