So, what i need to do?

thanks

Why is it better if your code is not faster?

Time: 1361ms Passed: 7 Failed: 0 Exit Code: 1
I have increased recursion depth and passed all cases with nice time, but still see exit code!
How to solve this problem?

Time: 1875ms Passed: 8 Failed: 0 Exit Code: 1

I have increased recursion depth and passed all cases with nice time, but still see exit code about recursion depth!
How to solve this problem?

Only 138. No idea, how how to shorten 10 characters more. Can anybody give advice?

I was hrdcode this one. I had no ideas what to do with repititions and my range increased too fast, so, i used range n * 5. Didnt think about deque or two lists etc. It was hard for me. IMO, its not 4 kyu.

brilliant

Its awful, i know, but i have no idea, how else))

Funny, thanks))

Not readble.

I wrote the same. Nice.

Oh, sorry, it works only when seq contains number with odd occurrences.
Anyway:
when seq = [1,1,2] * (10**5 + 1)
Your: 216, 206, 206, 208 ms per loop
My: 222, 216, 218, 213 ms per loop

when seq = [1,1,2] * (10**6 + 1]
Your: 2.34, 2.47, 2.16, 2.76 s per loop
My: 2.15, 2.19, 2.53, 2.14 s per loop

Your code more clearly, yep

its doesnt work, cmon