| LFU Cache | Hard | 48.6% | 80.0% |
| Smallest Substring With Identical Characters I | Hard | 20.4% | 72.5% |
| Smallest Substring With Identical Characters II | Hard | 40.2% | 72.5% |
| Minimize Malware Spread | Hard | 43.0% | 65.8% |
| Distinct Subsequences | Hard | 51.5% | 64.2% |
| Maximum Frequency Stack | Hard | 66.6% | 62.4% |
| Find Subarray With Bitwise OR Closest to K | Hard | 30.8% | 60.5% |
| Find the Minimum Area to Cover All Ones II | Hard | 63.6% | 60.5% |
| Count the Number of Inversions | Hard | 29.7% | 60.5% |
| Maximize Grid Happiness | Hard | 40.9% | 60.5% |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 55.9% |
| Find the Last Marked Nodes in Tree | Hard | 55.6% | 55.9% |
| Count Subarrays With Median K | Hard | 47.7% | 53.2% |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 53.2% |
| Reverse Nodes in k-Group | Hard | 65.4% | 53.2% |
| Trapping Rain Water | Hard | 66.8% | 50.1% |
| Count Palindromic Subsequences | Hard | 41.0% | 50.1% |
| Number of Digit One | Hard | 37.7% | 50.1% |
| Minimum Window Substring | Hard | 47.0% | 46.4% |
| Subarrays with K Different Integers | Hard | 67.6% | 41.9% |
| Minimum Difficulty of a Job Schedule | Hard | 59.7% | 41.9% |
| Median of Two Sorted Arrays | Hard | 46.0% | 41.9% |
| Word Ladder | Hard | 44.9% | 41.9% |
| Merge k Sorted Lists | Hard | 58.9% | 41.9% |
| Collect Coins in a Tree | Hard | 39.7% | 36.1% |
| Strange Printer | Hard | 60.9% | 36.1% |
| Find Median from Data Stream | Hard | 54.2% | 36.1% |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 36.1% |
| Number of Visible People in a Queue | Hard | 72.4% | 36.1% |
| Optimal Account Balancing | Hard | 50.3% | 36.1% |
| Reconstruct Itinerary | Hard | 44.3% | 36.1% |
| First Missing Positive | Hard | 42.5% | 36.1% |
| Sliding Window Maximum | Hard | 48.5% | 36.1% |
| Maximal Rectangle | Hard | 58.1% | 36.1% |
| Minimum Replacements to Sort the Array | Hard | 53.2% | 28.2% |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% | 28.2% |
| Time Taken to Cross the Door | Hard | 50.1% | 28.2% |
| Maximum Number of Ways to Partition an Array | Hard | 35.6% | 28.2% |
| Basic Calculator | Hard | 46.6% | 28.2% |
| Maximum Number of Non-overlapping Palindrome Substrings | Hard | 43.3% | 28.2% |
| Candy | Hard | 48.0% | 28.2% |
| Max Chunks To Make Sorted II | Hard | 54.7% | 28.2% |
| Bus Routes | Hard | 47.1% | 28.2% |
| Course Schedule III | Hard | 41.4% | 28.2% |
| Minimum Window Subsequence | Hard | 43.8% | 28.2% |
| Maximum Path Quality of a Graph | Hard | 61.7% | 28.2% |
| Burst Balloons | Hard | 63.0% | 28.2% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 28.2% |
| Sliding Window Median | Hard | 38.9% | 28.2% |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 28.2% |
| Largest Rectangle in Histogram | Hard | 49.4% | 28.2% |
