User solved it (I copied View Solution code and started debugging, but passed Attempt on first try) but didn't bother to close Question afterwards -.-

No problems with Python tests therefore & closing Question.

.

In case of in it depends on data structure. Hashmap based set and dict don't iterate items (unless everything has the same hash which is extremely unlikely), but list and tuple do.

Either author should specify that blatant for shouldn't be used or add tests accodringly to your' suggestion.

When a continuous string of digits exceeds 3...

"&z371" is not a continuous string of digits.

Is it a wrong test case?

It is a question not an issue. It's not a wrong case (notice that 253 people passed the Python kata). You should read the description once more.

 B Y B A Y A X X X B
   | |_| |___|   |
   |_____________|

fixed

Hi, it has nothing to do with sets, I think it would work the same way with lists...

Notice How D is outside of solve, D is generated only once for the whole battery of tests (kind of a rudimentary memoization).

I think it could be even faster with lists, by taking advantage of order, but since there are not that much evernety nubers, this is not required to solve the problem.

See https://en.wikipedia.org/wiki/Leap_year#Algorithm

Yes, 1900 is not a leap year.

You need to be able to use all the caracters from the two strings so:
isMatching("kata", "kt", "aaa") return false

Read the full description.

You're claiming detail has two i's.

How ironic!

yes (with the array longer are of length equal to 3)

OK now.