omg

See
https://junli.netlify.app/en/overlapping-regular-expression-in-python/
For a bit of an explanation as to how the lookahead is working and a link to a relevant Stack Overflow question.

Yeah, I don't know how the author did it, but that test is brilliant.

Another coincidence ^^ ~~

Love your solution with the identity function, very elegant.

Adding to this: The second element in the tuple is used to solve the ties of the first element. Thus c.upper() renders every element a capital letter so sorted sees bBaAa as BBAAA. To solve the ties for BB and AAA we use c.islower() to get 01 and 010 sorted to 10 and 100 for the ties inside the same letters giving you BbAaa.

You can of course stack more than two criteria in the tuple for additional tie brakers.

Solved it: Apperantly a uniform distribution of password lengths is required.

Testing for password lengths ...
Passwords lengths are not different enough! (6-20 chars)

What?

Funny how this gets best practice upvotes, ugly runtime...

Is it? O(n) versus O(1)? Not?

Had no idea you could chain those . calls, that would have made my solution a LOT simpler.

I understand Blind4Basics's method, but I don't understand this. Does anyone give me some help?