O(n^2)

Because the man was given directions to go from one point to another.
If he just stays still people will think he hasn't reached his destination.

ofc, i am not writting it for you, my friend-gamburger.
it is not actually translatable, so you have to learn russian to understand, sorry.

I don't understand. This website uses English. You may use a translator.

для гениев, вроде меня:
while (**hello)
вот эта xyйня бляTь, при заходе за пределы массива, не завершает цикл, а уходит в ошибку : SIGSEGV (11). Invalid memory access.

Check Solutions, O(n) is possible.

Task that do not allow you to chose an O(n) algorithm because you have to keep directions in order. So you have to go for O(n^2), something that you would definitly avoid IRL!

PEP 8
Max line length:)

All inputs are guaranteed to have a final palindrome smaller than 2^63

The description clearly says that such cases will not be tested.

Add 196 to a test, 99% of solutions didn't get what they are asked to do. So if they'll get 196 or any other Lychrel number as a test, they'll drop into infinite loop.

Honestly, I think you are a genius.

Not an issue. The tests work perfectly fine.

The test for python 3.6 is broken. I attempted and submitted successfully, but the test fails. It tells me that I was trying to use some variable(that obviously is not in my code) before I defined it.