Don't worry about it. I solved this problem in two ways. First, classically, as I would do in a structured programming language, for example in Delphi - using a for loop and a condition. And then, for my own pleasure, in one line. Of course, it's better not to do this in real problems)

You're asking programmers to not explain why bad code is bad.

Great kata of the bowling series, well done.

I knew it! (There is should be an elegant "python" way to do that)!

Wish I had done it this clean!

damn, forgot this method exited haha

i like how every comment is just "this is not best practice!!!"

guys, chill

The count method is called for each unique character in the text, leading to an overall time complexity of 𝑂(𝑛⋅𝑚)
O(n⋅m), where n is the length of the text and 𝑚 is the number of unique characters. This can be inefficient for large texts.

OP solved it, closing

OP solved it, closing. (Your initial code will not work for odd number of chained calls)

What is the added value of defaultdict in this scenario?

same! :D

In one line but for what price... The code is terribly inefficient. Your solution has more lines but it is faster and cleaner.