I really enjoyed this kata. I am still quite new to python, and when I first saw this about a month ago I thought it was going to be impossible for me to do. It took me a while because there are so many cases to watch for. And my solution may not be very elegant, but it ran quicker than I thought it would run (around 600 ms). A good kata to dip my toes into OOP.

It's a very simple thing to program given you know the pattern. In fact, that's true for almost any codewars problem. If you know or understand the problem, it should be quite easy. This problem is just particularly easy because it's only one to two lines.

Fun kata. Optimizing everything from determining whether a number is prime to determining how many primes is good information to have. I do wonder what the average runtime for this is though. My solution took 9 seconds the few times I ran it, and I thought I had a pretty fast algorithm.

This issue isn't present in actual attempting of the kata, aka sumbission, but the first trial case is indeed incorrect.