Your logic is wrong.

ZeroDivisionError: float modulo

You are checking on x instead of n. Therefore, x would eventually become zero. You also did not consider cases for powers beyond 3.

it's not about python but rather about algorithms and data structures (related to big O notations and time complexity of implementations)

yes, that's it. It could. The only thing making it finite is the available amount of time for solving, but you should aim for a solution that could go at any "depth" in the sequence.

Sorry, but IMO your talking complete rubbish! No offence intended. The clarity of the instructions should not be related to the difficulty of the challenge. Authors and translators should take responsibility for ensuring that their instructions are understandable particularly when English may not be the first language of many members.

The highest/lowest element is respectively only one element at each edge, even if there are more than one with the same value

Example: { 1, 1, 11, 2, 3 } => 1 + 2 + 3 = 6

Which part of the sentence "You're not meant to calculate the factorial" do you not understand? You'll never solve the task this way.

Hint: You're not meant to calculate the factorial. Find another way to find the number of zeros.

Not an issue. Your solution is inefficient.

how smart you are .One day I can post a bunch of garbled characters, which may be included in 1kyu according to what you said.

Yes, you can print the input.

nope, sorry. The wording is matching what you actually find in assembly-like languages, so it's the correct wording. ;)

That would work if the kata was "Single Cola" ;)

If you print the input values you could see exactly how your function is being tested.