Very efficient!
Great job!

I feel dump

awesome!

really awesome

nice solution!!!
new way of thinking unlocked

I really like this solution, is clever, short and easy to understand.

Nani?

really cool

nice!

Damnnnnnnnnnnnn... this solution is mindblowing. Absolutely stunning way to solve this mentally/algorithm. I bow down to thy greatness.

Edit - I noticed there's a tiny flaw with this code though. It's a lucky coincidence it passes the test for [' ', ' ', ' ', 'a', ' ', ''], but if the array has an empty string in the beginning, the code fails. To rectify: just add a .strip() after every .lower(). I realized this test failure while playing around your algorithm with other indices, specifically the indices -1, -2 & -3.

i traced the code, what i observed was that u are ignoring the negtive elements while addinf and assigning it to max found
but according to the description we can't do that

Impressively simple! I hopefully have learned something here!

I wanted to make the same assignment in the first line of the code, but I got an error because I did not put parentheses in tuples.
Dude, this is really elegant! Thanks to you, I've learned a lot about ternary operators and unpacking tuples in them !
Thank you!