| Trapping Rain Water | 66.8% | 80 |
| Median of Two Sorted Arrays | 46.0% | 52 |
| Sliding Window Maximum | 48.5% | 50 |
| Merge k Sorted Lists | 58.9% | 46 |
| Text Justification | 50.5% | 41 |
| Word Ladder | 44.9% | 39 |
| Find Median from Data Stream | 54.2% | 37 |
| Minimum Window Substring | 47.0% | 36 |
| First Missing Positive | 42.5% | 34 |
| Reverse Nodes in k-Group | 65.4% | 30 |
| LFU Cache | 48.6% | 30 |
| Largest Rectangle in Histogram | 49.4% | 29 |
| Regular Expression Matching | 30.5% | 28 |
| Binary Tree Maximum Path Sum | 42.0% | 27 |
| Basic Calculator | 46.6% | 25 |
| Word Search II | 38.1% | 24 |
| Candy | 48.0% | 23 |
| Longest Valid Parentheses | 38.1% | 23 |
| Serialize and Deserialize Binary Tree | 60.4% | 22 |
| Maximum Profit in Job Scheduling | 54.6% | 20 |
| Alien Dictionary | 37.1% | 20 |
| Sudoku Solver | 65.4% | 20 |
| Reconstruct Itinerary | 44.3% | 19 |
| Split Array Largest Sum | 59.9% | 19 |
| Integer to English Words | 34.8% | 19 |
| Bus Routes | 47.1% | 19 |
| Wildcard Matching | 31.4% | 19 |
| Word Break II | 55.1% | 17 |
| Making A Large Island | 56.3% | 16 |
| Maximal Rectangle | 58.1% | 16 |
| Max Points on a Line | 30.3% | 15 |
| Best Time to Buy and Sell Stock III | 53.2% | 15 |
| N-Queens | 75.0% | 14 |
| Longest Increasing Path in a Matrix | 56.3% | 14 |
| Trapping Rain Water II | 64.0% | 14 |
| Number of Visible People in a Queue | 72.4% | 14 |
| Design In-Memory File System | 48.4% | 14 |
| Reaching Points | 34.2% | 14 |
| Binary Tree Cameras | 47.6% | 13 |
| Shortest Path in a Grid with Obstacles Elimination | 46.1% | 13 |
| Vertical Order Traversal of a Binary Tree | 53.3% | 13 |
| Frog Jump | 47.1% | 13 |
| Burst Balloons | 63.0% | 13 |
| Word Ladder II | 27.5% | 13 |
| The Skyline Problem | 45.0% | 13 |
| Basic Calculator III | 53.2% | 13 |
| Shortest Distance from All Buildings | 44.9% | 13 |
| Minimum Number of Taps to Open to Water a Garden | 51.0% | 12 |
| All O`one Data Structure | 44.2% | 12 |
| Subarrays with K Different Integers | 67.6% | 12 |
| Sliding Window Median | 38.9% | 12 |
| Department Top Three Salaries | 59.9% | 11 |
| Insert Delete GetRandom O(1) - Duplicates allowed | 36.4% | 11 |
| Distinct Subsequences | 51.5% | 11 |
| Special Binary String | 79.3% | 10 |
| Employee Free Time | 72.8% | 10 |
| Russian Doll Envelopes | 37.7% | 10 |
| Substring with Concatenation of All Words | 34.0% | 10 |
| Maximum Frequency Stack | 66.6% | 10 |
| Design Search Autocomplete System | 49.7% | 10 |
| Optimal Account Balancing | 50.3% | 9 |
| Number of Atoms | 65.1% | 9 |
| Number of Islands II | 40.4% | 9 |
| Meeting Rooms III | 51.6% | 9 |
| Minimum Edge Reversals So Every Node Is Reachable | 57.3% | 9 |
| Smallest Range Covering Elements from K Lists | 70.1% | 9 |
| Partition Array Into Two Arrays to Minimize Sum Difference | 23.0% | 9 |
| N-Queens II | 78.2% | 9 |
| Max Stack | 45.9% | 9 |
| Best Time to Buy and Sell Stock IV | 49.5% | 9 |
| Design a Text Editor | 50.1% | 9 |
| Count Palindromic Subsequences | 41.0% | 9 |
| Remove Boxes | 49.3% | 9 |
| Minimize Malware Spread | 43.0% | 9 |
| Number of Ways to Form a Target String Given a Dictionary | 56.6% | 9 |
| Parallel Courses III | 66.8% | 8 |
| Design Excel Sum Formula | 39.9% | 8 |
| Cherry Pickup | 39.1% | 8 |
| Palindrome Partitioning II | 36.6% | 8 |
| IPO | 53.3% | 8 |
| Remove Invalid Parentheses | 49.8% | 8 |
| Guess the Word | 36.9% | 8 |
| Best Meeting Point | 61.4% | 8 |
| Collect Coins in a Tree | 39.7% | 8 |
| Block Placement Queries | 18.4% | 8 |
| Consecutive Numbers Sum | 42.6% | 7 |
| Critical Connections in a Network | 59.3% | 7 |
| Minimum Cost to Cut a Stick | 62.8% | 7 |
| Minimum Number of Refueling Stops | 41.1% | 7 |
| Valid Number | 22.6% | 7 |
| Rearranging Fruits | 57.5% | 7 |
| Minimum Cost to Make Array Equal | 46.7% | 7 |
| Count Subarrays With Fixed Bounds | 69.2% | 7 |
| Swim in Rising Water | 67.6% | 7 |
| Maximum Performance of a Team | 47.7% | 7 |
| Robot Room Cleaner | 77.9% | 7 |
| Find Servers That Handled Most Number of Requests | 45.2% | 7 |
| Minimum Cost to Make at Least One Valid Path in a Grid | 70.9% | 7 |
| Expression Add Operators | 42.8% | 7 |
| Design Skiplist | 59.5% | 7 |
| Shortest Palindrome | 41.9% | 6 |
| Create Maximum Number | 34.7% | 6 |
| Shortest Path to Get All Keys | 54.3% | 6 |
| Parsing A Boolean Expression | 69.8% | 6 |
| Palindrome Pairs | 37.0% | 6 |
| Reverse Pairs | 33.7% | 6 |
| Dungeon Game | 40.9% | 6 |
| Permutation Sequence | 52.2% | 6 |
| Unique Paths III | 82.8% | 6 |
| Put Marbles in Bags | 72.2% | 6 |
| Scramble String | 43.9% | 6 |
| Find the Closest Palindrome | 31.8% | 6 |
| Longest Duplicate Substring | 31.1% | 6 |
| Maximum Number of Events That Can Be Attended II | 63.6% | 6 |
| K-th Smallest in Lexicographical Order | 46.2% | 6 |
| Maximum Number of Tasks You Can Assign | 50.2% | 6 |
| Strange Printer | 60.9% | 6 |
| Split Message Based on Limit | 42.0% | 6 |
| Delete Duplicate Folders in System | 77.7% | 6 |
| Maximum Number of Visible Points | 38.0% | 6 |
| Maximum Number of Points From Grid Queries | 59.3% | 6 |
| 24 Game | 59.3% | 6 |
| Minimum One Bit Operations to Make Integers Zero | 78.5% | 6 |
| Number of Flowers in Full Bloom | 57.7% | 6 |
| Minimum Replacements to Sort the Array | 53.2% | 6 |
| Minimum Insertion Steps to Make a String Palindrome | 73.7% | 5 |
| Sliding Puzzle | 74.2% | 5 |
| Contains Duplicate III | 24.5% | 5 |
| Cherry Pickup II | 72.3% | 5 |
| Find K-th Smallest Pair Distance | 46.3% | 5 |
| Serialize and Deserialize N-ary Tree | 68.6% | 5 |
| Minimum Difficulty of a Job Schedule | 59.7% | 5 |
| Find Minimum Time to Finish All Jobs | 45.4% | 5 |
| Human Traffic of Stadium | 50.8% | 5 |
| Escape the Spreading Fire | 37.6% | 5 |
| Strong Password Checker | 15.5% | 5 |
| Maximum Difference Between Even and Odd Frequency II | 48.7% | 5 |
| Sum of Distances in Tree | 65.5% | 5 |
| Number of Submatrices That Sum to Target | 74.6% | 5 |
| Longest Path With Different Adjacent Characters | 54.0% | 5 |
| Zuma Game | 30.2% | 5 |
| Painting the Walls | 48.9% | 5 |
| Word Abbreviation | 62.7% | 5 |
| Maximum Path Quality of a Graph | 61.7% | 5 |
| Divide Nodes Into the Maximum Number of Groups | 67.0% | 4 |
| Parse Lisp Expression | 53.5% | 4 |
| Maximum Candies You Can Get from Boxes | 67.9% | 4 |
| Minimum Cost to Reach Destination in Time | 41.2% | 4 |
| Minimum Window Subsequence | 43.8% | 4 |
| Minimum Initial Energy to Finish Tasks | 60.7% | 4 |
| Allocate Mailboxes | 56.5% | 4 |
| Maximum Score From Grid Operations | 27.1% | 4 |
| Robot Collisions | 56.1% | 4 |
| Recover a Tree From Preorder Traversal | 83.2% | 4 |
| Count Subarrays With Median K | 47.7% | 4 |
| Divide an Array Into Subarrays With Minimum Cost II | 54.7% | 4 |
| Longest Happy Prefix | 51.9% | 4 |
| Count of Range Sum | 38.3% | 4 |
| Number of Digit One | 37.7% | 4 |
| Minimum Difference in Sums After Removal of Elements | 69.8% | 4 |
| Length of Longest V-Shaped Diagonal Segment | 56.3% | 4 |
| Shortest Subarray with Sum at Least K | 32.6% | 4 |
| Find in Mountain Array | 41.2% | 4 |
| Trips and Users | 37.7% | 4 |
| Kth Smallest Product of Two Sorted Arrays | 48.9% | 4 |
| Maximize Subarrays After Removing One Conflicting Pair | 64.7% | 4 |
| Maximum Sum of 3 Non-Overlapping Subarrays | 59.7% | 4 |
| Sum of Prefix Scores of Strings | 60.8% | 4 |
| Set Intersection Size At Least Two | 57.9% | 4 |
| Minimum Number of Increments on Subarrays to Form a Target Array | 78.1% | 4 |
| Rearrange String k Distance Apart | 39.9% | 4 |
| Arithmetic Slices II - Subsequence | 54.9% | 4 |
| Minimum Number of Removals to Make Mountain Array | 54.8% | 4 |
| Maximum Employees to Be Invited to a Meeting | 61.8% | 4 |
| Find Maximum Non-decreasing Array Length | 18.5% | 4 |
| Maximum Score Words Formed by Letters | 81.5% | 4 |
| Max Chunks To Make Sorted II | 54.7% | 4 |
| Maximum Running Time of N Computers | 56.4% | 4 |
| Number of Ways to Paint N × 3 Grid | 80.5% | 4 |
| Range Module | 44.7% | 4 |
| Super Egg Drop | 29.9% | 4 |
| Minimum Number of Days to Disconnect Island | 58.8% | 4 |
| Time Taken to Cross the Door | 50.1% | 4 |
| Replace Non-Coprime Numbers in Array | 57.7% | 4 |
| Longest Cycle in a Graph | 50.5% | 4 |
| Minimum Cost Walk in Weighted Graph | 68.3% | 4 |
| Valid Arrangement of Pairs | 66.5% | 4 |
| Count Different Palindromic Subsequences | 47.5% | 4 |
| Count the Number of Inversions | 29.7% | 4 |
| Subarray With Elements Greater Than Varying Threshold | 45.3% | 4 |
| Count the Number of Arrays with K Matching Adjacent Elements | 58.4% | 4 |
| Painting a Grid With Three Different Colors | 77.3% | 4 |
| Split Array With Same Average | 26.8% | 4 |
| Tallest Billboard | 51.8% | 4 |
| String Compression II | 52.2% | 4 |
| Sort Items by Groups Respecting Dependencies | 65.6% | 4 |
| Maximum Building Height | 38.3% | 4 |
| Similar String Groups | 56.1% | 4 |
| Non-negative Integers without Consecutive Ones | 41.7% | 4 |
| Reachable Nodes In Subdivided Graph | 51.8% | 4 |
