Max (or near max) indexes should be tested for all bases, otherwise invalid solutions can pass, that don't check high enough primes (e.g. base 30, k = 150)

Please, approve. Fixed the issue and my other suggestion. https://www.codewars.com/kumite/68464a8559f4cd4106ecef5c?sel=68464a8559f4cd4106ecef5c

author is no longer active, you may propose a fork if you want

If you decided to use type annotations, please, be consistent and do it for the function return type as well.

The description must use "nonempty substring", instead of just "substring". If we allow an empty substring, we usually assume it's zero when converted to an integer, therefore no numbers satisfy the condition, because every number contains empty substring.

Great kata of the series.

Let's approve this one. Now you can focus on the harder kata.

This comment has been deleted.

lookup table gang

If we only display using alphabet extensions then of course the limit is 36, but some solutions just convert the number to the base using a different function (which may cause errors for bases higher than 36 but i can remove them). If you insist on having a display system for bases higher than 36, then you can display a list of numbers representing the value of that "symbol"

For example: "ABC" in base 16 will instead be [10, 11, 12]

How would bases higher than 36 work (which alphabet extensions ..), and what would be the limit?

Fastest solution so far

@author: are you happy with the current constraints of n and k for this kata?