Thanks, all.
For all the reasons mentioned I'm moving this permanently to draft.

I learned something new. Thanks!

I wasn't able to find the ref sol anywhere in online forums. I learned something new here, thanks for that.

Deleting a kata with solutions is impossible. Unpublishing is the most you can do, and you can do that yourself.

Sorry it didn't work out.

thanks @monadis. I see your point. The Kata seems useless now. unfortunatly i don't have permission to delete it but whoever has is welcome to delete it. thanks for your time all.

My O(n) solution is faster than your O(n / 3) solution. It is almost never a good idea to optimize a constant factor in Python because Python is not a low level language.

Thanks for the example. I now see what you meant. Fixed.

That's what I'm seeing. And the link on Point in Circle still goes to ../train/python.

Let me know.

This is what i'm seeing:

This kata is based on Points in Circle by hubencu_st.

You have the radius of a circle with the center in point (0,0).

Write a function that calculates the number of points in the circle where (x,y) - the cartesian coordinates of the points - are integers.

This kata requires an algorith running time complexity O(n/3) to pass.

Maybe there's some caching happening, but I still show the link to the other kata going to the trainer and not the description.

If you're sure you changed it, and published the change, ignore it; it might be better tomorrow morning. If you forgot to republish or anything - it does not actually look fixed on my side.

resolved

I would consider asking for a constant factor of 3 to be asking for micro-optimisation.

But I suggest you get some more opinions on Discord; don't take my word as gospel. ( Not every opinion you might collect there will be correct. If a couple of actually knowledgable people call it micro-optimisation, it's micro-optimisation, no matter if Joe Nono says it isn't. )

I do agree that in the big O notation O(n) is the same as O(n/3) but in practice a time complexity of n/3 is 3 times faster than a time complexity of n.
For this reason, the solutions of the original kata (only tried python) are not fast enough to pass this one.
If you consider this to be a micro optimization, there's no room for this kata on the website and I'm happy to unpublish it.
Thanks.

I think I got it. thanks.