| 218 | The Skyline Problem | — | Hard | ArrayDivide and ConquerBinary Indexed Tree | 44% | |
| 220 | Contains Duplicate III | — | Hard | ArraySliding WindowSorting | 24% | |
| 315 | Count of Smaller Numbers After Self | — | Hard | ArrayBinary SearchDivide and Conquer | 43% | |
| 327 | Count of Range Sum | — | Hard | ArrayBinary SearchDivide and Conquer | 37% | |
| 352 | Data Stream as Disjoint Intervalsread | — | Hard | Binary SearchDesignOrdered Set | 59% | |
| 363 | Max Sum of Rectangle No Larger Than Kread | — | Hard | ArrayBinary SearchMatrix | 45% | |
| 456 | 132 Pattern | — | Medium | ArrayBinary SearchStack | 34% | |
| 493 | Reverse Pairs | — | Hard | ArrayBinary SearchDivide and Conquer | 32% | |
| 497 | Random Point in Non-overlapping Rectanglesread | — | Medium | ArrayMathBinary Search | 38% | |
| 699 | Falling Squares | — | Hard | ArraySegment TreeOrdered Set | 46% | |
| 715 | Range Module | — | Hard | DesignSegment TreeOrdered Set | 44% | |
| 729 | My Calendar Iread | — | Medium | ArrayBinary SearchDesign | 58% | |
| 731 | My Calendar II | — | Medium | ArrayBinary SearchDesign | 62% | |
| 732 | My Calendar III | — | Hard | Binary SearchDesignSegment Tree | 71% | |
| 850 | Rectangle Area II | — | Hard | ArraySegment TreeLine Sweep | 54% | |
| 855 | Exam Room | — | Medium | DesignHeap (Priority Queue)Ordered Set | 43% | |
| 895 | Maximum Frequency Stack | — | Hard | Hash TableStackDesign | 66% | |
| 975 | Odd Even Jump | — | Hard | ArrayDynamic ProgrammingStack | 41% | |
| 1348 | Tweet Counts Per Frequency | — | Medium | Hash TableBinary SearchDesign | 45% | |
| 1418 | Display Table of Food Orders in a Restaurant | — | Medium | ArrayHash TableString | 76% | |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | — | Medium | ArrayQueueSliding Window | 57% | |
| 1606 | Find Servers That Handled Most Number of Requestsread | — | Hard | ArrayGreedyHeap (Priority Queue) | 44% | |
| 1649 | Create Sorted Array through Instructions | — | Hard | ArrayBinary SearchDivide and Conquer | 40% | |
| 1675 | Minimize Deviation in Array | — | Hard | ArrayGreedyHeap (Priority Queue) | 54% | |
| 1818 | Minimum Absolute Sum Difference | — | Medium | ArrayBinary SearchSorting | 31% | |
| 1825 | Finding MK Average | — | Hard | DesignQueueHeap (Priority Queue) | 38% | |
| 1847 | Closest Room | — | Hard | ArrayBinary SearchSorting | 40% | |
| 1912 | Design Movie Rental System | — | Hard | ArrayHash TableDesign | 35% | |
| 2034 | Stock Price Fluctuation | — | Medium | Hash TableDesignHeap (Priority Queue) | 48% | |
| 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | — | Hard | ArrayTwo PointersBinary Search | 22% | |
| 2102 | Sequentially Ordinal Rank Tracker | — | Hard | DesignHeap (Priority Queue)Data Stream | 62% | |
| 2179 | Count Good Triplets in an Array | — | Hard | ArrayBinary SearchDivide and Conquer | 66% | |
| 2213 | Longest Substring of One Repeating Character | — | Hard | ArrayStringSegment Tree | 33% | |
| 2251 | Number of Flowers in Full Bloom | — | Hard | ArrayHash TableBinary Search | 57% | |
| 2276 | Count Integers in Intervals | — | Hard | DesignSegment TreeOrdered Set | 34% | |
| 2336 | Smallest Number in Infinite Set | — | Medium | Hash TableDesignHeap (Priority Queue) | 70% | |
| 2349 | Design a Number Container System | — | Medium | Hash TableDesignHeap (Priority Queue) | 57% | |
| 2353 | Design a Food Rating System | — | Medium | ArrayHash TableString | 45% | |
| 2363 | Merge Similar Itemsread | — | Easy | ArrayHash TableSorting | 77% | |
| 2382 | Maximum Segment Sum After Removals | — | Hard | ArrayUnion FindPrefix Sum | 48% | |
| 2424 | Longest Uploaded Prefix | — | Medium | Binary SearchUnion FindDesign | 54% | |
| 2426 | Number of Pairs Satisfying Inequality | — | Hard | ArrayBinary SearchDivide and Conquer | 45% | |
| 2612 | Minimum Reverse Operationsread | — | Hard | ArrayBreadth-First SearchOrdered Set | 15% | |
| 2659 | Make Array Emptyread | — | Hard | ArrayBinary SearchGreedy | 25% | |
| 2713 | Maximum Strictly Increasing Cells in a Matrixread | — | Hard | ArrayHash TableBinary Search | 31% | |
| 2762 | Continuous Subarrays | — | Medium | ArrayQueueSliding Window | 58% | |
| 2763 | Sum of Imbalance Numbers of All Subarrays | — | Hard | ArrayHash TableOrdered Set | 42% | |
| 2817 | Minimum Absolute Difference Between Elements With Constraint | — | Medium | ArrayBinary SearchOrdered Set | 34% | |
| 3092 | Most Frequent IDs | — | Medium | ArrayHash TableHeap (Priority Queue) | 41% | |
| 3102 | Minimize Manhattan Distances | — | Hard | ArrayMathGeometry | 31% | |