Test coverage is insufficient: the C == 3/R == 3 case is seldom tested in the random tests. Anything above 4 is trivially generalizable, so testing those are much less important than the 3/4 ones.

Kinda old but hey.
Tests except a path for R=2, C=4 (and others) but it doesn't exist.

I even tried feeding it the whole permutations set, none of them worked but it's still expecting a path.

Added! Thanks for the suggestion

You could add the examples test cases to the actual testset.

Hey guys! I just made my first kata and I would love if some people could try it out. I've given it an estimated rank of 4kyu because it can be overthinked very easily. However, there is a simple solution that I believe many overlook.

Please give it a try and inform me about any errors :)
https://www.codewars.com/kata/5e750dd4626ac30012e35c77/python

My code generates the prime numbers upto 50 million in less than 2 seconds yet it is not passing.

The first kata that i did not know how to code xD
It is so easy on paper, but requires a lot of thought on computer.

Great Kata!

Not a question.