| Bus Routes | Hard | 47.1% | 100.0% |
| Alien Dictionary | Hard | 37.1% | 93.5% |
| Number of Islands II | Hard | 40.4% | 88.0% |
| Find the Closest Palindrome | Hard | 31.8% | 80.5% |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% | 73.8% |
| Word Search II | Hard | 38.1% | 73.8% |
| Count Paths That Can Form a Palindrome in a Tree | Hard | 48.4% | 70.2% |
| Text Justification | Hard | 50.5% | 69.4% |
| Block Placement Queries | Hard | 18.4% | 67.7% |
| Making A Large Island | Hard | 56.3% | 64.8% |
| Basic Calculator | Hard | 46.6% | 62.7% |
| Design In-Memory File System | Hard | 48.4% | 61.5% |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 58.9% |
| Split Message Based on Limit | Hard | 42.0% | 58.9% |
| Escape the Spreading Fire | Hard | 37.6% | 58.9% |
| Cherry Pickup | Hard | 39.1% | 57.5% |
| Minimum Window Substring | Hard | 47.0% | 57.5% |
| Merge k Sorted Lists | Hard | 58.9% | 57.5% |
| Minimum Number of Operations to Make Array Continuous | Hard | 52.1% | 57.5% |
| Divide Nodes Into the Maximum Number of Groups | Hard | 67.0% | 56.0% |
| All O`one Data Structure | Hard | 44.2% | 56.0% |
| Sudoku Solver | Hard | 65.4% | 54.4% |
| Split Array Largest Sum | Hard | 59.9% | 52.6% |
| Meeting Rooms III | Hard | 51.6% | 52.6% |
| Regular Expression Matching | Hard | 30.5% | 52.6% |
| Trips and Users | Hard | 37.7% | 52.6% |
| Optimal Account Balancing | Hard | 50.3% | 50.6% |
| Count Subarrays With Fixed Bounds | Hard | 69.2% | 50.6% |
| Find the Number of Ways to Place People II | Hard | 64.4% | 50.6% |
| Word Break II | Hard | 55.1% | 50.6% |
| Hopper Company Queries III | Hard | 65.3% | 50.6% |
| Check for Contradictions in Equations | Hard | 43.8% | 50.6% |
| Random Pick with Blacklist | Hard | 34.6% | 50.6% |
| Find Pattern in Infinite Stream II | Hard | 67.5% | 50.6% |
| Hopper Company Queries II | Hard | 39.7% | 50.6% |
| Number Of Ways To Reconstruct A Tree | Hard | 45.5% | 50.6% |
| Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | 70.2% | 50.6% |
| Falling Squares | Hard | 47.4% | 50.6% |
| Number of Ways to Reach Destination in the Grid | Hard | 58.2% | 50.6% |
| Hopper Company Queries I | Hard | 48.0% | 50.6% |
| Find Median from Data Stream | Hard | 54.2% | 46.1% |
| Largest Rectangle in Histogram | Hard | 49.4% | 46.1% |
| Word Ladder | Hard | 44.9% | 46.1% |
| Sliding Window Maximum | Hard | 48.5% | 46.1% |
| Dungeon Game | Hard | 40.9% | 43.4% |
| Longest Path With Different Adjacent Characters | Hard | 54.0% | 43.4% |
| Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 70.9% | 43.4% |
| Collect Coins in a Tree | Hard | 39.7% | 40.3% |
| Trapping Rain Water | Hard | 66.8% | 40.3% |
| Candy | Hard | 48.0% | 40.3% |
| Maximum Number of Points From Grid Queries | Hard | 59.3% | 36.6% |
| 24 Game | Hard | 59.3% | 36.6% |
| The Skyline Problem | Hard | 45.0% | 36.6% |
| Reconstruct Itinerary | Hard | 44.3% | 36.6% |
| LFU Cache | Hard | 48.6% | 36.6% |
| Sliding Puzzle | Hard | 74.2% | 36.6% |
| Burst Balloons | Hard | 63.0% | 36.6% |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 36.6% |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 36.6% |
| Shortest Path to Get All Keys | Hard | 54.3% | 32.2% |
| Subarrays with K Different Integers | Hard | 67.6% | 32.2% |
| Word Ladder II | Hard | 27.5% | 32.2% |
| Replace Non-Coprime Numbers in Array | Hard | 57.7% | 32.2% |
| Shortest Palindrome | Hard | 41.9% | 32.2% |
| Longest Valid Parentheses | Hard | 38.1% | 32.2% |
| Number of Flowers in Full Bloom | Hard | 57.7% | 32.2% |
| Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | 66.3% | 32.2% |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 32.2% |
| Count the Number of Infection Sequences | Hard | 37.2% | 26.6% |
| IPO | Hard | 53.3% | 26.6% |
| Maximum Frequency Stack | Hard | 66.6% | 26.6% |
| Put Marbles in Bags | Hard | 72.2% | 26.6% |
| Graph Connectivity With Threshold | Hard | 49.2% | 26.6% |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 26.6% |
| Design Search Autocomplete System | Hard | 49.7% | 26.6% |
| Design a Text Editor | Hard | 50.1% | 26.6% |
| Median of Two Sorted Arrays | Hard | 46.0% | 26.6% |
| Minimum Number of Refueling Stops | Hard | 41.1% | 19.2% |
| Find All People With Secret | Hard | 48.4% | 19.2% |
| Rearranging Fruits | Hard | 57.5% | 19.2% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 19.2% |
| Find K-th Smallest Pair Distance | Hard | 46.3% | 19.2% |
| Painting a Grid With Three Different Colors | Hard | 77.3% | 19.2% |
| Patching Array | Hard | 54.1% | 19.2% |
| Swim in Rising Water | Hard | 67.6% | 19.2% |
| Amount of New Area Painted Each Day | Hard | 55.6% | 19.2% |
| Minimize Malware Spread | Hard | 43.0% | 19.2% |
| Minimize Malware Spread II | Hard | 45.5% | 19.2% |
| Count Palindromic Subsequences | Hard | 41.0% | 19.2% |
| Count Different Palindromic Subsequences | Hard | 47.5% | 19.2% |
| Count Prefix and Suffix Pairs II | Hard | 28.1% | 19.2% |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 19.2% |
| Reverse Nodes in k-Group | Hard | 65.4% | 19.2% |
| Count Integers in Intervals | Hard | 35.7% | 19.2% |
| Human Traffic of Stadium | Hard | 50.8% | 19.2% |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 19.2% |
| Minimum Difference in Sums After Removal of Elements | Hard | 69.8% | 19.2% |
| Freedom Trail | Hard | 59.2% | 19.2% |
| Process Restricted Friend Requests | Hard | 59.5% | 19.2% |
| Checking Existence of Edge Length Limited Paths | Hard | 63.2% | 19.2% |
| Shortest Distance from All Buildings | Hard | 44.9% | 19.2% |
| Number of Ways to Form a Target String Given a Dictionary | Hard | 56.6% | 19.2% |
