just wow

Try to be helpful mate. Thanks

Ultra-sleek

thanks for the point, I didn't know that. is there any O(n) solution for this kata?

You do know that using the "in" operator has a compexity of O(n) too right? The time complexity of your code is basically the same as OP.

Just google it and you will find out.

Why do i need to put '*' before args ?

Can someone please explain how this comprehension works? How does the sum function sum the letters with other letters in their groups?

It simply changes the tuple args into a string literal, meaning it contains all spaces and punctuation as well as brackets.
I'm not a fan of this solution though, it iterates through that whole (in worst case) literal ten times.

Your wife said the opposite to me 😎😎

My wife said the same thing... ;-)

it is so short!