Given an array of integers nums, return the same array sorted in ascending order. Implement the sorting logic yourself; do not use built-in sorting helpers. You may modify the input array in place or return a new sorted array.
Constraints
0 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
The array may contain duplicate values and negative numbers
Aim for better than O(n^2) time on large inputs
Interviewer
Your question is Sort an Integer Array In Place. Start with the requirements in the Question tab.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
