You can do a one liner in O(n) with recursion but for the large arrays the recursion depth exceeds

For some unknown reason the source code has been changed for the solution of this kata (the indentation had been changed to tabs and a hex value checking for class C networks had been erroneously changed (making some tests fail).

Again, I have no idea as to why or how this has happened, but I have now fixed the issue.

If anyone knows how to see who changed source code (revision history for a translation), please let me know because I can't seem to find it.

Ofc you can use range -> BRUH. Just now a range object, so change it to list(range()).

I guess the real speed was the friends we made along the way

(but yeah, it's O(n^2), they just wanted the one-liner)

Because letters is actually a tuple, the way Python works.

It seems that you solved it...

strptime is part of datetime is part of datetime amirite

Read how you use append and mark your post as having spoiler content next time.

you can look it up online

sort() modifies the input in-place, it returns None

old kata==easy kata

Not an issue. Your solution is completely wrong.