Time complexity of calculating approximation by the given algorithm is more expensive than calculating actual root.
What a kata 🫠

Should be mentioned in the description that queens are not attacking other queens and can be places anywhere relative to each other.

It's not how you measure bytes.
But if you go this route, then the description should mention that the kata follows deceptive marketing trick and measuares go as follows:
1TB = 1000000MB,
1GB = 1000MB,
1MB = 1000B

Also tags make no sense as this kata has nothing to do with arrays, it is more about basic math.

For some reason I expected this kata to have some trick math solution, but alas, it's pretty straitforward.

I've had similar bugs IRL. It's good to be aware of such issues, nice kata.

Rejected...

Should address this issue in the description instead of simply replacing the Ruby / Crystal / Java specific function with Python's.

Also, the new author solution is arguably inferior because it can now incorrectly match characters that are not between the ASCII digits 0 to 9. Consider that:

print("①".isdigit())    # True
print("⑵".isdigit())   # True
print(("³").isdigit())  # True

Done

The idea of the kata was to illustrate using a dictionary to improve efficiency of search. Without that, I'm not sure it's very interesting.

I have no control over the rating. It was set by the reviewers in the beta phase. My understanding is that it cannot be changed now.

100k data sets for a 7kyu kata is overkill. That's why raiting falling pretty bad.
I suggest limiting the amount to 1k and do not bother with efficiency (because that would put the kata in 6kyu category).

As a reminder:
https://docs.codewars.com/curation/references/kata-ranks#7-kyu

The kata description could be more Python-oriented for sure, but the instructions themselves are fairly clear and straightforward. Additionally, there's already another issue addressing this, making a second issue seems redundant.

IMHO current constraints makes it 6kyu.
At 7kyu brute-force solutions should be accepted.

much more torough tests have been added to C#. tons of solutions did not make it ;-)

added in Java