This one is concise and well-understandable, respect!

The explanations I have seen suggest that for short lists sorting and slicing can be faster but sorted() starts to chug on big lists, so min() max() is better practice when you don't know how big the list is going to be.

my brain hurt bro,what is going on,wth man
ok i got it but i forgot the(start,stop,step) XD

No, it doesn't.

Here's a profile of running this problem 10 million times with an if/if/if solution versus an if/elif/else solution:

if_if_if completed 10000000 iterations
Sum time: 5684.13ms
Mean time: 568.41ns
Standard deviation: 1684.53ns

if_elif_else completed 10000000 iterations
Sum time: 5685.18ms
Mean time: 568.52ns
Standard deviation: 1642.49ns

Even if it did, if you care about nanoseconds you shouldn't be choosing different flow control syntax in Python, you should be choosing a different language.

if elif else statement works faster than if if if

man,really really thank you, i get it now.

because it refers to step. range(start, stop, step)

why you repeat x? can you explain pls, i don´t get it.

That's what I did

What is more performancy - list() or [for in]?

Very clever!!!

nice rewrite :)

love this

Every time I use regex I learn something new. Very elegant compared to mine.