| 23 | Merge k Sorted Lists | — | Hard | Linked ListDivide and ConquerHeap (Priority Queue) | 56% | |
| 215 | Kth Largest Element in an Array | — | Medium | ArrayDivide and ConquerSorting | 68% | |
| 218 | The Skyline Problem | — | Hard | ArrayDivide and ConquerBinary Indexed Tree | 44% | |
| 239 | Sliding Window Maximum | — | Hard | ArrayQueueSliding Window | 47% | |
| 253 | Meeting Rooms II | — | Medium | ArrayTwo PointersGreedy | 52% | |
| 264 | Ugly Number II | — | Medium | Hash TableMathDynamic Programming | 49% | |
| 295 | Find Median from Data Stream | — | Hard | Two PointersDesignSorting | 53% | |
| 347 | Top K Frequent Elements | — | Medium | ArrayHash TableDivide and Conquer | 64% | |
| 355 | Design Twitter | — | Medium | Hash TableLinked ListDesign | 42% | |
| 373 | Find K Pairs with Smallest Sums | — | Medium | ArrayHeap (Priority Queue) | 41% | |
| 378 | Kth Smallest Element in a Sorted Matrix | — | Medium | ArrayBinary SearchSorting | 63% | |
| 407 | Trapping Rain Water II | — | Hard | ArrayBreadth-First SearchHeap (Priority Queue) | 59% | |
| 420 | Strong Password Checker | — | Hard | StringGreedyHeap (Priority Queue) | 15% | |
| 451 | Sort Characters By Frequency | — | Medium | Hash TableStringSorting | 74% | |
| 480 | Sliding Window Median | — | Hard | ArrayHash TableSliding Window | 39% | |
| 502 | IPO | — | Hard | ArrayGreedySorting | 53% | |
| 506 | Relative Ranksread | — | Easy | ArraySortingHeap (Priority Queue) | 73% | |
| 621 | Task Scheduler | — | Medium | ArrayHash TableGreedy | 61% | |
| 630 | Course Schedule III | — | Hard | ArrayGreedySorting | 41% | |
| 632 | Smallest Range Covering Elements from K Lists | — | Hard | ArrayHash TableGreedy | 70% | |
| 658 | Find K Closest Elements | — | Medium | ArrayTwo PointersBinary Search | 49% | |
| 659 | Split Array into Consecutive Subsequences | — | Medium | ArrayHash TableGreedy | 51% | |
| 675 | Cut Off Trees for Golf Event | — | Hard | ArrayBreadth-First SearchHeap (Priority Queue) | 35% | |
| 692 | Top K Frequent Words | — | Medium | ArrayHash TableString | 59% | |
| 703 | Kth Largest Element in a Stream | — | Easy | TreeDesignBinary Search Tree | 60% | |
| 743 | Network Delay Time | — | Medium | Depth-First SearchBreadth-First SearchGraph | 57% | |
| 767 | Reorganize String | — | Medium | Hash TableStringGreedy | 56% | |
| 778 | Swim in Rising Water | — | Hard | ArrayBinary SearchDepth-First Search | 63% | |
| 786 | K-th Smallest Prime Fraction | — | Medium | ArrayTwo PointersBinary Search | 68% | |
| 787 | Cheapest Flights Within K Stops | — | Medium | Dynamic ProgrammingDepth-First SearchBreadth-First Search | 40% | |
| 855 | Exam Room | — | Medium | DesignHeap (Priority Queue)Ordered Set | 43% | |
| 857 | Minimum Cost to Hire K Workers | — | Hard | ArrayGreedySorting | 63% | |
| 862 | Shortest Subarray with Sum at Least K | — | Hard | ArrayBinary SearchQueue | 32% | |
| 871 | Minimum Number of Refueling Stops | — | Hard | ArrayDynamic ProgrammingGreedy | 41% | |
| 882 | Reachable Nodes In Subdivided Graph | — | Hard | GraphHeap (Priority Queue)Shortest Path | 51% | |
| 912 | Sort an Array | — | Medium | ArrayDivide and ConquerSorting | 57% | |
| 973 | K Closest Points to Origin | — | Medium | ArrayMathDivide and Conquer | 68% | |
| 1046 | Last Stone Weight | — | Easy | ArrayHeap (Priority Queue) | 66% | |
| 1054 | Distant Barcodes | — | Medium | ArrayHash TableGreedy | 47% | |
| 1094 | Car Pooling | — | Medium | ArraySortingHeap (Priority Queue) | 56% | |
| 1172 | Dinner Plate Stacks | — | Hard | Hash TableStackDesign | 33% | |
| 1263 | Minimum Moves to Move a Box to Their Target Location | — | Hard | ArrayBreadth-First SearchHeap (Priority Queue) | 49% | |
| 1268 | Search Suggestions System | — | Medium | ArrayStringBinary Search | 65% | |
| 1337 | The K Weakest Rows in a Matrixread | — | Easy | ArrayBinary SearchSorting | 74% | |
| 1338 | Reduce Array Size to The Halfread | — | Medium | ArrayHash TableGreedy | 69% | |
| 1353 | Maximum Number of Events That Can Be Attended | — | Medium | ArrayGreedySorting | 33% | |
| 1354 | Construct Target Array With Multiple Sums | — | Hard | ArrayHeap (Priority Queue) | 36% | |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | — | Hard | ArrayBreadth-First SearchGraph | 71% | |
| 1383 | Maximum Performance of a Team | — | Hard | ArrayGreedySorting | 48% | |
| 1388 | Pizza With 3n Slices | — | Hard | ArrayDynamic ProgrammingGreedy | 53% | |