Hi! I've cross checked a few of these between mine and your code. Some of them are actually equal but, like you said, some are different. Give me a day or so to look further and see which is correct :)

Thanks!

yeah no i take it back. turns out [min(ls), max(ls)] defaults to te same (but lower level) algorithm in c. So this kata just doesn't work in python

hiya. yeahhhh ive taken it down for now.
the point of this kata is that you can actually solve this by looking at pairs of numbers and then comparing the smaller of those to the current minimum and the larger to the current maximum. The only problem is the time complexity is the same as the straight forwad solutions and there's only about a 1.5x time difference between the fast and 'slow solution'. So making tests that only pass the faster one is pretty difficult. I've taken it down and I'l see what i can do

Hey! You're the first person to complete this kata and i was just wondering.
Could you try explain your code? I'd be really grateful since I don't actually have any reason to think my solution is the best way to go about it and would love to compare.
Thanks :)