I think it is just O(n)?? If I can assume that the functions always do simple additions and multiplications meaning they are O(1), then the function chainer will execute n of these.

So it should just be O(n), regardless of the recursive nature of this kata.

The test case failed but the submit cases passed.

Your solution is great! Rather, I was hoping someone could tell me what the name of this syntax is, and what it means?

def mirror(data: list) -> list:

Why is the parameter defined like that, and what does it do?

For some reason I did not think of this. I feel humbled.

I love this kata. I originally had a more complicated solution, but since the servers timed out I was forced to redo it.

After drawing out a list of numbers the solution became so obvious!

I vote as best practice.

s[::2], s[1::2] = s1[::2], s2[1::2]

works after i changed your code to the above. I don't know how you passed with your version.. ?

But undeniably clever way to do it.

I tried to run this in my shell, but it does not work.. what gives?

float is an inbuilt operator, and shows more clearly the intent behind the *1.0 part of your equation.

Assuming that *1.0 is meant to convert the number to a float.

not should equal "nottest".
Woah, what a nice fail statement. Really makes me want to rate this zero.

Sick of solving katas, only to discover they cannot be beaten due to some bullshit assert statement.

I really like this solution. Probably because I tried a similar logic, but this code is SO much cleaner and shorter than mine. Teaches me a lot to wade through it.

My solution works fine when I work on it in pycharm. Perhaps I misunderstand the question. But this seems silly to me now.

My program properly writes Hello World! to the screen, but here I got some instance, unbound error? Pycharm does not seem to have this problem.

What gives?