| 218 | The Skyline Problem | — | Hard | ArrayDivide and ConquerBinary Indexed Tree | 44% | |
| 307 | Range Sum Query - Mutable | — | Medium | ArrayDesignBinary Indexed Tree | 42% | |
| 315 | Count of Smaller Numbers After Self | — | Hard | ArrayBinary SearchDivide and Conquer | 43% | |
| 327 | Count of Range Sum | — | Hard | ArrayBinary SearchDivide and Conquer | 37% | |
| 406 | Queue Reconstruction by Height | — | Medium | ArrayBinary Indexed TreeSegment Tree | 74% | |
| 493 | Reverse Pairs | — | Hard | ArrayBinary SearchDivide and Conquer | 32% | |
| 673 | Number of Longest Increasing Subsequence | — | Medium | ArrayDynamic ProgrammingBinary Indexed Tree | 50% | |
| 1157 | Online Majority Element In Subarray | — | Hard | ArrayBinary SearchDesign | 39% | |
| 1395 | Count Number of Teams | — | Medium | ArrayDynamic ProgrammingBinary Indexed Tree | 70% | |
| 1409 | Queries on a Permutation With Key | — | Medium | ArrayBinary Indexed TreeSimulation | 85% | |
| 1505 | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | — | Hard | StringGreedyBinary Indexed Tree | 40% | |
| 1649 | Create Sorted Array through Instructions | — | Hard | ArrayBinary SearchDivide and Conquer | 40% | |
| 1964 | Find the Longest Valid Obstacle Course at Each Position | — | Hard | ArrayBinary SearchBinary Indexed Tree | 63% | |
| 2179 | Count Good Triplets in an Array | — | Hard | ArrayBinary SearchDivide and Conquer | 66% | |
| 2193 | Minimum Number of Moves to Make Palindrome | — | Hard | Two PointersStringGreedy | 52% | |
| 2250 | Count Number of Rectangles Containing Each Point | — | Medium | ArrayHash TableBinary Search | 36% | |
| 2286 | Booking Concert Tickets in Groupsread | — | Hard | Binary SearchDesignBinary Indexed Tree | 17% | |
| 2407 | Longest Increasing Subsequence II | — | Hard | ArrayDivide and ConquerDynamic Programming | 25% | |
| 2424 | Longest Uploaded Prefix | — | Medium | Binary SearchUnion FindDesign | 54% | |
| 2426 | Number of Pairs Satisfying Inequality | — | Hard | ArrayBinary SearchDivide and Conquer | 45% | |
| 2552 | Count Increasing Quadruplets | — | Hard | ArrayDynamic ProgrammingBinary Indexed Tree | 34% | |
| 2659 | Make Array Emptyread | — | Hard | ArrayBinary SearchGreedy | 25% | |
| 2736 | Maximum Sum Queries | — | Hard | ArrayBinary SearchStack | 28% | |
| 2916 | Subarrays Distinct Element Sum of Squares II | — | Hard | ArrayDynamic ProgrammingBinary Indexed Tree | 21% | |
| 2926 | Maximum Balanced Subsequence Sum | — | Hard | ArrayBinary SearchDynamic Programming | 25% | |
| 2940 | Find Building Where Alice and Bob Can Meetread | — | Hard | ArrayBinary SearchStack | 52% | |
| 3072 | Distribute Elements Into Two Arrays II | — | Hard | ArrayBinary Indexed TreeSegment Tree | 29% | |
| 3161 | Block Placement Queries | — | Hard | ArrayBinary SearchBinary Indexed Tree | 17% | |
| 3187 | Peaks in Array | — | Hard | ArrayBinary Indexed TreeSegment Tree | 26% | |
| 3245 | Alternating Groups III | — | Hard | ArrayBinary Indexed Tree | 15% | |
| 3380 | Maximum Area Rectangle With Point Constraints I | — | Medium | ArrayMathBinary Indexed Tree | 49% | |
| 3382 | Maximum Area Rectangle With Point Constraints II | — | Hard | ArrayMathBinary Indexed Tree | 20% | |
| 3515 | Shortest Path in a Weighted Tree | — | Hard | ArrayTreeDepth-First Search | 31% | |