Sort an array of integers in non-decreasing order by implementing merge sort. Return a new sorted array and do not rely on Python's built-in sorting functions.
Constraints
0 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
Handle duplicates, negatives, and empty input correctly
Interviewer
Your question is Implement Merge Sort for Integers. 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.
