Hard Problems on Sorting
- Find Surpasser Count of each element in array
- Count distinct occurrences as a subsequence
- Count minimum number of subsets (or subsequences) with consecutive numbers
- Chose k array elements such that difference of maximum and minimum is minimized
- Minimum swap required to convert binary tree to binary search tree
- K-th smallest element after removing some integers from natural numbers
- Maximum difference between frequency of two elements such that element having greater frequency is also greater
- Minimum swaps to reach permuted array with at most 2 positions left swaps allowed
- Find whether it is possible to make array elements same using one external number
- Sort an array after applying the given equation
- Print array of strings in sorted order without copying one string into another
Quick Links :
- ‘Practice Problems’ on Sorting
- ‘Quizzes’ on Sorting
Recommended:
Sorting Algorithms
A Sorting Algorithm is used to rearrange a given array or list of elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of elements in the respective data structure.
For Example: The below list of characters is sorted in increasing order of their ASCII values. That is, the character with a lesser ASCII value will be placed first than the character with a higher ASCII value.
Table of Content
- What is Sorting?
- Sorting Terminology
- Characteristics of Sorting Algorithms
- Applications of Sorting Algorithms
- Basics of Sorting Algorithms
- Sorting Algorithms
- Library Implementations
- Easy Problems on Sorting
- Medium Problems on Sorting
- Hard Problems on Sorting
Contact Us