| 1 |
Count Good Triplets in an Array |
Hard |
ArrayBinary SearchDivide and Conquer |
| 2 |
Count of Range Sum |
Hard |
ArrayBinary SearchDivide and Conquer |
| 3 |
Count of Smaller Numbers After Self |
Hard |
ArrayBinary SearchDivide and Conquer |
| 4 |
Count Subarrays With More Ones Than Zeros |
Medium |
ArrayHash TableBinary Search |
| 5 |
Count the Number of K-Big Indices |
Hard |
ArrayBinary SearchDivide and Conquer |
| 6 |
Create Sorted Array through Instructions |
Hard |
ArrayBinary SearchDivide and Conquer |
| 7 |
Find the Index of Permutation |
Medium |
ArrayBinary SearchDivide and Conquer |
| 8 |
Linked List Sorter |
Medium |
Linked ListsLinked ListMerge Sort |
| 9 |
Merge k Sorted Lists |
Hard |
Linked ListDivide and ConquerHeap (Priority Queue) |
| 10 |
Number of Pairs Satisfying Inequality |
Hard |
ArrayBinary SearchDivide and Conquer |
| 11 |
Reverse Pairs |
Hard |
ArrayBinary SearchDivide and Conquer |
| 12 |
Sort an Array |
Medium |
ArrayDivide and ConquerSorting |
| 13 |
Sort List |
Medium |
Linked ListTwo PointersDivide and Conquer |