resulting in a linear time complexity.
Good

sorting -> nlogn time complexity, mutating input array is bad or cloning array -> n space complexity.
Meanwile this solution -> n time complexity, O(1) -> space complexity

nice solution

yes. it expresses the idea more clearly while also maintaining correctness for any number.

Faster than sorting.

Great solution!

Can someone walk me through why this is more efficient than sorting?

brilliant 100% outstanding

how have u come up with this? it is brilliant

I don't understand why this isn't the top voted solution. It's more efficient and clever than sorting.