| 23 | Merge k Sorted Lists | Hard | linked list |
| 264 | Ugly Number II | Medium | binary heap |
| 295 | Find Median from Data Stream | Hard | binary heap |
| 313 | Super Ugly Number | Medium | binary heap |
| 347 | Top K Frequent Elements | Medium | sort |
| 355 | Design Twitter | Medium | design |
| 358 | Rearrange String k Distance Apart | Hard | binary heap |
| 373 | Find K Pairs with Smallest Sums | Medium | binary heap |
| 378 | Kth Smallest Element in a Sorted Matrix | Medium | binary heap |
| 407 | Trapping Rain Water II | Hard | binary heap |
| 480 | Sliding Window Median | Hard | binary heap |
| 502 | IPO | Hard | binary heap |
| 632 | Smallest Range | Hard | binary heap |
| 692 | Top K Frequent Words | Medium | sort |
| 703 | Kth Largest Element in a Stream | Easy | binary heap |
| 846 | Hand of Straights | Medium | binary heap |
| 855 | Exam Room | Medium | binary heap |
| 973 | K Closest Points to Origin | Easy | sort |
| 1046 | Last Stone Weight | Easy | binary heap |
| 1057 | Campus Bikes | Medium | binary heap |
| 1229 | Meeting Scheduler | Medium | sort |
| 1235 | Maximum Profit in Job Scheduling | Hard | dynamic programming |
| 1353 | Maximum Number of Events That Can Be Attended | Medium | greedy |
| 1354 | Construct Target Array With Multiple Sums | Hard | greedy |
| 1383 | Maximum Performance of a Team | Hard | greedy |
| 1642 | Furthest Building You Can Reach | Medium | binary heap |
| 1675 | Minimize Deviation in Array | Hard | binary heap |
| 1705 | Maximum Number of Eaten Apples | Medium | greedy |
| 1792 | Maximum Average Pass Ratio | Medium | binary heap |
| 1801 | Number of Orders in the Backlog | Medium | greedy |
| 1845 | Seat Reservation Manager | Medium | design |
| 1851 | Minimum Interval to Include Each Query | Hard | sort |
| 1882 | Process Tasks Using Servers | Medium | binary heap |
| 1942 | The Number of the Smallest Unoccupied Chair | Medium | sort |
| 1962 | Remove Stones to Minimize the Total | Medium | binary heap |
| 2034 | Stock Price Fluctuation | Medium | design |
| 2054 | Two Best Non-Overlapping Events | Medium | binary heap |
| 2158 | Amount of New Area Painted Each Day | Hard | sort |
| 2163 | Minimum Difference in Sums After Removal of Elements | Hard | binary heap |
| 2208 | Minimum Operations to Halve Array Sum | Medium | binary heap |
| 2233 | Maximum Product After K Increments | Medium | sort |
| 2254 | Design Video Sharing Platform | Hard | design |
| 2263 | Make Array Non-decreasing or Non-increasing | Hard | greedy |
| 2336 | Smallest Number in Infinite Set | Medium | design |
| 2386 | Find the K-Sum of an Array | Hard | binary heap |
| 2402 | Meeting Rooms III | Hard | binary heap |
| 2462 | Total Cost to Hire K Workers | Medium | binary heap |
| 2503 | Maximum Number of Points From Grid Queries | Hard | breadth first search |
| 2519 | Count the Number of K-Big Indices | Hard | binary heap |
| 2530 | Maximal Score After Applying K Operations | Medium | binary heap |
| 2532 | Time to Cross a Bridge | Hard | simulation |
| 2542 | Maximum Subsequence Score | Medium | greedy |
| 2558 | Take Gifts From the Richest Pile | Easy | binary heap |
| 2594 | Minimum Time to Repair Cars | Medium | binary search |
| 2599 | Make the Prefix Sum Non-negative | Medium | greedy |
| 2813 | Maximum Elegance of a K-Length Subsequence | Hard | greedy |
| 2818 | Apply Operations to Maximize Score | Hard | binary heap |
| 2835 | Minimum Operations to Form Subsequence With Target Sum | Hard | greedy |
| 2931 | Minimum Equal Sum of Two Arrays After Replacing Zeros | Hard | greedy |
| 2940 | Find Building Where Alice and Bob Can Meet | Hard | binary search |
| 3013 | Divide an Array Into Subarrays With Minimum Cost II | Hard | two pointers |
| 3049 | Earliest Second to Mark Indices II | Hard | binary search |
| 3066 | Minimum Operations to Exceed Threshold Value II | Medium | binary heap |
| 3080 | Mark Elements on Array by Performing Queries | Medium | binary heap |
| 3081 | Replace Question Marks in String to Minimize Its Value | Medium | sort |
| 3092 | Most Frequent IDs | Medium | binary heap |
| 3256 | Maximum Value Sum by Placing Three Rooks I | Hard | binary heap |
| 3257 | Maximum Value Sum by Placing Three Rooks II | Hard | binary heap |
| 3264 | Final Array State After K Multiplication Operations I | Easy | two pointers |
| 3266 | Final Array State After K Multiplication Operations II | Hard | two pointers |
| 3275 | K-th Nearest Obstacle Queries | Medium | binary heap |
| 3296 | Minimum Number of Seconds to Make Mountain Height Zero | Medium | binary search |
| 3362 | Zero Array Transformation III | Medium | greedy |
| 3391 | Design a 3D Binary Matrix with Efficient Layer Tracking | Medium | design |
| 3478 | Choose K Elements With Maximum Sum | Medium | greedy |
| 3506 | Find Time Required to Eliminate Bacterial Strains | Hard | greedy |
| 3684 | Maximize Sum of At Most K Distinct Elements | Easy | binary heap |
| 3691 | Maximum Total Subarray Value II | Hard | binary heap |
| 3711 | Maximum Transactions Without Negative Balance | Medium | greedy |
| 3781 | Maximum Score After Binary Swaps | Medium | binary heap |
| 3801 | Minimum Cost to Merge Sorted Lists | Hard | dynamic programming |
| 3815 | Design Auction System | Medium | design |
| 3885 | Design Event Manager | Medium | design |
| 3892 | Minimum Operations to Achieve At Least K Peaks | Hard | greedy |
| 3962 | Maximum Subarray Sum After at Most K Swaps | Hard | binary heap |