Mid/SeniorArrayBucket SortCounting SortDivide and ConquerHeap (Priority Queue)Merge SortRadix SortSorting
Sort an Array
Given an array of integers nums, sort the array in ascending order and return it.
You must solve the problem without using any built-in functions in O(nlog(n)) time complexity and with the smallest space complexity possible.
Example 1
Input
nums = [5,2,3,1]Output
[1,2,3,5]After sorting the array, the positions of some numbers are not changed, such as 2 and 3, while the positions of other numbers are changed, such as 1 and 5.
Example 2
Input
nums = [5,1,1,2,0,0]Output
[0,0,1,1,2,5]The values of
nums are not necessarily unique.Constraints
- 1 <= nums.length <= 5 * 10^4
- -5 * 10^4 <= nums[i] <= 5 * 10^4
Asked at 12 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.