Nice. Similar to mine, but slightly more efficient. Wise use of the for loop. I chose a while loop, which required one more variable than is necessary with the for loop.

And your solution just looks cleaner than mine. Less clutter, simpler variable names. Nice work.

Bone!

explain why pls

Beautiful :)

i dont think this is a good practic. idk

It does the trick but there are some really concise solutions here with a fraction of the upvotes...

learnes a big lesson

very clever. never thought of this.

yes it makes the code easier but it doesn't safe

Nice way to evaluate the arr is not empty or None.

Sorted is O(n log n) complexity, both sorted and sort use the same algorithm behind the scenes. Creating a list is O(1).

Wouldn't that be slower.

L comment I won't lie

Sum of arithmetic sequence formula :)

It can also be None according to the kata description, which would then return None and fail.