| 1 |
Alternating Groups III |
Hard |
ArrayBinary Indexed TreeOrdered Set |
| 2 |
Block Placement Queries |
Hard |
ArrayBinary SearchBinary Indexed Tree |
| 3 |
Booking Concert Tickets in Groups |
Hard |
Binary SearchDesignBinary Indexed Tree |
| 4 |
Count Good Triplets in an Array |
Hard |
ArrayBinary SearchDivide and Conquer |
| 5 |
Count Increasing Quadruplets |
Hard |
ArrayDynamic ProgrammingBinary Indexed Tree |
| 6 |
Count Number of Rectangles Containing Each Point |
Medium |
ArrayHash TableBinary Search |
| 7 |
Count Number of Teams |
Medium |
ArrayDynamic ProgrammingBinary Indexed Tree |
| 8 |
Count of Range Sum |
Hard |
ArrayBinary SearchDivide and Conquer |
| 9 |
Count of Smaller Numbers After Self |
Hard |
ArrayBinary SearchDivide and Conquer |
| 10 |
Count Subarrays With More Ones Than Zeros |
Medium |
ArrayHash TableBinary Search |
| 11 |
Count the Number of K-Big Indices |
Hard |
ArrayBinary SearchDivide and Conquer |
| 12 |
Create Sorted Array through Instructions |
Hard |
ArrayBinary SearchDivide and Conquer |
| 13 |
Distribute Elements Into Two Arrays II |
Hard |
ArrayBinary Indexed TreeSegment Tree |
| 14 |
Find Building Where Alice and Bob Can Meet |
Hard |
ArrayBinary SearchStack |
| 15 |
Find the Index of Permutation |
Medium |
ArrayBinary SearchDivide and Conquer |