If you mean the alphabetical order of stock names, they are irrelevant here.

The task asks only to compute the final buy and sell values, and mark any badly formatted stocks.

The restrictins in Python are ridiculous and don't allow for much variety in or elegant solutions.

I had a very similar error. I submitted again without changing any of my code and it accepted. It seems like the tests are not consistent

me too

Replace f' formatting with .format()

What do you mean? There's an explicit nested loop, and an implicit nested loop here.

I believe the kata is specifically trying to prevent solutions that count, requiring you to find an O(1) solution by seeing a pattern.

❗❗ The first and the last continent are NOT connected!

;p

yes, it's better practice to use a tuple. And it's precisely because a tuple cannot generate side effects, that it's better to use it than a list.... x)

There are many, many ways to solve this kata, algorithmically speaking. It is of course not unreasonable to set the rank according to the easiest possibility, and according to the cleanest possible implementation.

That said, I don't think it would have been unreasonable to rank this as a 6. But that's not up to me. And yes, in general, kata rank is deflating. Whether you agree with it or not, it is what it is.

Sorry, I found my solution wrong - there exists an array returned when N = 25, not null!

Of course I won't fail in both cases - could you please check through the test in python version? If you check it then you will know what I meant...