| 218 | The Skyline Problemread | — | Hard | ArrayDivide and ConquerBinary Indexed Tree | 44% | |
| 307 | Range Sum Query - Mutableread | — | 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% | |
| 699 | Falling Squares | — | Hard | ArraySegment TreeOrdered Set | 46% | |
| 715 | Range Moduleread | — | Hard | DesignSegment TreeOrdered Set | 44% | |
| 729 | My Calendar Iread | — | Medium | ArrayBinary SearchDesign | 58% | |
| 731 | My Calendar IIread | — | Medium | ArrayBinary SearchDesign | 62% | |
| 732 | My Calendar IIIread | — | Hard | Binary SearchDesignSegment Tree | 71% | |
| 850 | Rectangle Area IIread | — | Hard | ArraySegment TreeLine Sweep | 54% | |
| 1157 | Online Majority Element In Subarrayread | — | Hard | ArrayBinary SearchDesign | 39% | |
| 1395 | Count Number of Teamsread | — | Medium | ArrayDynamic ProgrammingBinary Indexed Tree | 70% | |
| 1505 | Minimum Possible Integer After at Most K Adjacent Swaps On Digitsread | — | Hard | StringGreedyBinary Indexed Tree | 40% | |
| 1521 | Find a Value of a Mysterious Function Closest to Targetread | — | Hard | ArrayBinary SearchBit Manipulation | 46% | |
| 1622 | Fancy Sequenceread | — | Hard | MathDesignSegment Tree | 17% | |
| 1649 | Create Sorted Array through Instructionsread | — | Hard | ArrayBinary SearchDivide and Conquer | 40% | |
| 1687 | Delivering Boxes from Storage to Portsread | — | Hard | ArrayDynamic ProgrammingSegment Tree | 39% | |
| 2080 | Range Frequency Queriesread | — | Medium | ArrayHash TableBinary Search | 40% | |
| 2179 | Count Good Triplets in an Array | — | Hard | ArrayBinary SearchDivide and Conquer | 66% | |
| 2213 | Longest Substring of One Repeating Characterread | — | Hard | ArrayStringSegment Tree | 33% | |
| 2276 | Count Integers in Intervalsread | — | Hard | DesignSegment TreeOrdered Set | 34% | |
| 2286 | Booking Concert Tickets in Groupsread | — | Hard | Binary SearchDesignBinary Indexed Tree | 17% | |
| 2407 | Longest Increasing Subsequence IIread | — | Hard | ArrayDivide and ConquerDynamic Programming | 25% | |
| 2424 | Longest Uploaded Prefixread | — | Medium | Binary SearchUnion FindDesign | 54% | |
| 2426 | Number of Pairs Satisfying Inequalityread | — | Hard | ArrayBinary SearchDivide and Conquer | 45% | |
| 2569 | Handling Sum Queries After Updateread | — | Hard | ArraySegment Tree | 29% | |
| 2659 | Make Array Emptyread | — | Hard | ArrayBinary SearchGreedy | 25% | |
| 2736 | Maximum Sum Queriesread | — | Hard | ArrayBinary SearchStack | 28% | |
| 2916 | Subarrays Distinct Element Sum of Squares IIread | — | Hard | ArrayDynamic ProgrammingBinary Indexed Tree | 21% | |
| 2926 | Maximum Balanced Subsequence Sumread | — | Hard | ArrayBinary SearchDynamic Programming | 25% | |
| 2940 | Find Building Where Alice and Bob Can Meetread | — | Hard | ArrayBinary SearchStack | 52% | |
| 3072 | Distribute Elements Into Two Arrays IIread | — | Hard | ArrayBinary Indexed TreeSegment Tree | 29% | |
| 3117 | Minimum Sum of Values by Dividing Arrayread | — | Hard | ArrayBinary SearchDynamic Programming | 27% | |
| 3161 | Block Placement Queriesread | — | Hard | ArrayBinary SearchBinary Indexed Tree | 17% | |
| 3165 | Maximum Sum of Subsequence With Non-adjacent Elementsread | — | Hard | ArrayDivide and ConquerDynamic Programming | 16% | |
| 3171 | Find Subarray With Bitwise OR Closest to Kread | — | Hard | ArrayBinary SearchBit Manipulation | 30% | |
| 3187 | Peaks in Arrayread | — | Hard | ArrayBinary Indexed TreeSegment Tree | 26% | |
| 3209 | Number of Subarrays With AND Value of K | — | Hard | ArrayBinary SearchBit Manipulation | 34% | |
| 3291 | Minimum Number of Valid Strings to Form Target Iread | — | Medium | ArrayStringBinary Search | 20% | |
| 3292 | Minimum Number of Valid Strings to Form Target IIread | — | Hard | ArrayStringBinary Search | 18% | |
| 3380 | Maximum Area Rectangle With Point Constraints I | — | Medium | ArrayMathBinary Indexed Tree | 49% | |
| 3382 | Maximum Area Rectangle With Point Constraints IIread | — | Hard | ArrayMathBinary Indexed Tree | 20% | |
| 3410 | Maximize Subarray Sum After Removing All Occurrences of One Element | — | Hard | ArrayDynamic ProgrammingSegment Tree | 19% | |
| 3420 | Count Non-Decreasing Subarrays After K Operationsread | — | Hard | ArrayStackSegment Tree | 20% | |
| 3454 | Separate Squares IIread | — | Hard | ArrayBinary SearchSegment Tree | 19% | |
| 3477 | Fruits Into Baskets IIread | — | Easy | ArrayBinary SearchSegment Tree | 52% | |
| 3480 | Maximize Subarrays After Removing One Conflicting Pairread | — | Hard | ArraySegment TreeEnumeration | 33% | |