Sorting&Searching Problems
Sorting and searching are the backbone of algorithm design. Practice merge sort, quicksort, binary search variations, and problems that reduce to clever search strategies.
15 problems
| Title | Difficulty | Platform |
|---|---|---|
| Allocate Minimum Pages | Practice | Hard | GeeksforGeeks |
| Ceiling in a sorted array | Easy | GeeksforGeeks |
| Check if reversing a sub array make the array sorted | Medium | GeeksforGeeks |
| Count of Smaller Numbers After Self | Hard | LeetCode |
| Find Peak Element | Medium | LeetCode |
| Make all array elements equal with minimum cost | Medium | GeeksforGeeks |
| Minimum swaps to sort an array | Hard | GeeksforGeeks |
| Pair with the given difference | Easy | GeeksforGeeks |
| Permute two arrays such that sum of every pair is greater or equal to K | Easy | GeeksforGeeks |
| Permute two arrays such that sum of every pair is greater or equal to K | Easy | GeeksforGeeks |
| Product of Array Except Self | Medium | GeeksforGeeks |
| Radix Sort – Data Structures and Algorithms Tutorials | Medium | GeeksforGeeks |
| Search in Rotated Sorted Array | Hard | LeetCode |
| Split Array Largest Sum | Hard | LeetCode |
| SPOJ.com - Problem AGGRCOW | Hard | Other |