True, but it's so beautiful. :D

Wow, great solve!

nice but using the count method inside a loop can be inefficient for large lists because count iterates through the list each time it is called, leading to an overall time complexity
also the method is straightforward and easy to implement but may not be optimal for very large datasets.

feels good my solution is the same as the fist ranking solution

WOWWWWWWWWWW :{

The other good option is Ellipsis.

It worked fine when I ran the code. Are you sure you're not mistaken? Does the test give a list with [None] and is it a requirement?

Yes. The "else: pass" in your code can be omitted without any issues.

I'm not sure if I understood you correctly, but this is, in fact, O(n^2) too.

Does not work when None is present, f.e. the list [None] as input won't work.

i like this one

Just a question for onestringers: indeed if works without else?
Victor Granddadcoder

woc，牛逼