| 264 | Ugly Number II | Medium | binary heap |
| 295 | Find Median from Data Stream | Hard | binary heap |
| 313 | Super Ugly Number | Medium | binary heap |
| 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 |
| 703 | Kth Largest Element in a Stream | Easy | binary heap |
| 846 | Hand of Straights | Medium | binary heap |
| 855 | Exam Room | Medium | binary heap |
| 857 | Minimum Cost to Hire K Workers | Hard | binary heap |
| 871 | Minimum Number of Refueling Stops | Hard | binary heap |
| 1046 | Last Stone Weight | Easy | binary heap |
| 1057 | Campus Bikes | Medium | binary heap |
| 1439 | Find the Kth Smallest Sum of a Matrix With Sorted Rows | Hard | binary heap |
| 1606 | Find Servers That Handled Most Number of Requests | Hard | binary heap |
| 1642 | Furthest Building You Can Reach | Medium | binary heap |
| 1675 | Minimize Deviation in Array | Hard | binary heap |
| 1792 | Maximum Average Pass Ratio | Medium | binary heap |
| 1882 | Process Tasks Using Servers | Medium | binary heap |
| 1962 | Remove Stones to Minimize the Total | Medium | binary heap |
| 2054 | Two Best Non-Overlapping Events | Medium | binary heap |
| 2163 | Minimum Difference in Sums After Removal of Elements | Hard | binary heap |
| 2208 | Minimum Operations to Halve Array Sum | Medium | binary heap |
| 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 |
| 2519 | Count the Number of K-Big Indices | Hard | binary heap |
| 2530 | Maximal Score After Applying K Operations | Medium | binary heap |
| 2558 | Take Gifts From the Richest Pile | Easy | binary heap |
| 2818 | Apply Operations to Maximize Score | Hard | binary heap |
| 3066 | Minimum Operations to Exceed Threshold Value II | Medium | binary heap |
| 3080 | Mark Elements on Array by Performing Queries | Medium | binary heap |
| 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 |
| 3275 | K-th Nearest Obstacle Queries | Medium | binary heap |
| 3684 | Maximize Sum of At Most K Distinct Elements | Easy | binary heap |
| 3691 | Maximum Total Subarray Value II | Hard | binary heap |
| 3781 | Maximum Score After Binary Swaps | Medium | binary heap |
| 3962 | Maximum Subarray Sum After at Most K Swaps | Hard | binary heap |