Hard Problems on Array Sorting
- Minimum number of swaps required to sort an array
- Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted
- Median in a stream of integers (running integers)
- Merge two sorted arrays with O(1) extra space
- Minimum De-arrangements present in array of AP (Arithmetic Progression)
- Divide an array into k segments to maximize maximum of segment minimums
- Maximum number of partitions that can be sorted individually to make sorted
- Rank of all elements in an array
- Merging two unsorted arrays in sorted order
- Sort an array after applying the given equation
- Minimum swaps to make two arrays consisting unique elements identical
Quick Links :
- ‘Practice Problems’ on Arrays
- ‘Quizzes’ on Arrays
- ‘Video Tutorials’ on Arrays
Sorting in Array
Sorting an array means arranging the elements of the array in a certain order. Generally sorting in an array is done to arrange the elements in increasing or decreasing order.