Feel relatively proud to solve something on HR that has a 65% success rate, but equally I know it only has a shit SR because the timeouts are ridiculously harsh.

I was using inplace quicksort, which is around O(n log n), but it was failing on one of the bigger inputs. Used a Rust default of timsort, which is O(n log n) -> O(n), which I didn't think would be especially different, and that passed all cases.

So that feels a bit shit that my implementation wasn't quick enough, or the data was so much more suited to timsort no implemented of qs was going to do it.