Isn't the time complexity O(n)? At least O(n²/(n+1)).

Same. I literally copy pasted this solution and it timed out. Maybe server works different depending on time?

Many solutions follow the same logic and work fine, you must be mistaken somewhere.

I did the exact same solution but it kept timing out. Why?

There are 6 code variations, all of them with removed lines

very unique.

why didn't you remove the last two lines?

please leave some jobs to the rest of us.

In my opinion the most beautiful solution of all

I just realize that it had something to do with aritmethic progressions. Then I read the respective chapter and I found the right formula.

did u find any useful stuff? how did they know?

Thanks.

It's a generator expression. See https://peps.python.org/pep-0289/

What kind of witchcraft is 'arr[0::,-1::-1].transpose()'?