Crystal Translation done, please check.

I did exactly as author , also please look to other katas' translations, you will see that not always translations should be the same (even for languages like C/C++ or Python/Ruby which are pretty similar). God bless u , dude

I tried to make it exactly like in original test. Is it ok now?

You can search about fibonacci ladder problem where length of steps not greater than 2. Then think about generalization of this problem.

If you explain nicely , I will try to fix translation. Thanks in advance.

It is very similar to number partition problems , isn't it? There are already lots of katas related with standart partition problem.

Can you explain in a bit more details what is wrong with this translation?

Oh , thanks

Crystal translation done , please check.

Am I only one who cannot submit the code. I pressed 10 times attempt, it passed each time random tests , but no sumbit button appears

Thanks , will consider in the future

Omg , 500 test cases. That is pretty nice problem. Indeed I thought that I will not pass random cases, but then it showed 11469.53ms .

Can someone tell how exactly should I write code in Python, I wrote a function which returns either True or False. In the terminal test cases work correct , but whenever I run in codewars , it says "True should equal False" even though program in fact returns False

Triangles and quadrilaterals should be built on all possible points: A , B , red points , and green points.

Yeap, you are right, not all the triangles and quadrilaterals should have a point or points which lay on the diameter