| Design In-Memory File System | Hard | 48.4% | 100.0% | |
| Happy Number | Easy | 59.2% | 100.0% | Hash TableMathTwo Pointers |
| Course Schedule II | Medium | 55.0% | 100.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Parallel Courses III | Hard | 66.8% | 87.5% | ArrayDynamic ProgrammingGraph Theory+1 |
| Word Search II | Hard | 38.1% | 87.5% | ArrayStringBacktracking+2 |
| Painting the Walls | Hard | 48.9% | 87.5% | ArrayDynamic Programming |
| Calculate Amount Paid in Taxes | Easy | 69.0% | 87.5% | ArraySimulation |
| Maximum Number of Upgradable Servers | Medium | 43.1% | 87.5% | |
| Find All Anagrams in a String | Medium | 53.3% | 87.5% | Hash TableStringSliding Window |
| Trapping Rain Water | Hard | 66.8% | 87.5% | ArrayTwo PointersDynamic Programming+2 |
| Minimum Window Substring | Hard | 46.9% | 87.5% | Hash TableStringSliding Window |
| Minimum Array Length After Pair Removals | Medium | 27.0% | 75.0% | ArrayHash TableTwo Pointers+3 |
| Number of Ways to Form a Target String Given a Dictionary | Hard | 56.6% | 75.0% | ArrayStringDynamic Programming |
| Basic Calculator | Hard | 46.5% | 75.0% | MathStringStack+1 |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 75.0% | ArrayBinary SearchDynamic Programming+1 |
| Find the Maximum Length of a Good Subsequence II | Hard | 25.1% | 75.0% | ArrayHash TableDynamic Programming |
| Find the Maximum Length of a Good Subsequence I | Medium | 32.5% | 75.0% | ArrayHash TableDynamic Programming |
| String Transformation | Hard | 26.6% | 75.0% | MathStringDynamic Programming+1 |
| Count Vowel Substrings of a String | Easy | 72.8% | 75.0% | Hash TableString |
| Merge k Sorted Lists | Hard | 58.8% | 75.0% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Throne Inheritance | Medium | 66.8% | 75.0% | Hash TableTreeDepth-First Search+1 |
| Step-By-Step Directions From a Binary Tree Node to Another | Medium | 56.4% | 75.0% | StringTreeDepth-First Search+1 |
| Two Sum | Easy | 57.1% | 75.0% | ArrayHash Table |
| Regular Expression Matching | Hard | 30.4% | 62.5% | StringDynamic ProgrammingRecursion |
| Time Based Key-Value Store | Medium | 49.7% | 62.5% | Hash TableStringBinary Search+1 |
| Boundary of Binary Tree | Medium | 47.9% | 62.5% | |
| Populating Next Right Pointers in Each Node II | Medium | 57.1% | 62.5% | Linked ListTreeDepth-First Search+2 |
| LRU Cache | Medium | 46.8% | 62.5% | Hash TableLinked ListDesign+1 |
| Design Hit Counter | Medium | 69.6% | 62.5% | |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 62.5% | ArrayHash TableMath+2 |
| Design HashMap | Easy | 66.4% | 62.5% | ArrayHash TableLinked List+2 |
| Course Schedule | Medium | 50.8% | 62.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Copy List with Random Pointer | Medium | 62.4% | 62.5% | Hash TableLinked List |
| Maximize Distance to Closest Person | Medium | 49.6% | 62.5% | Array |
| Max Area of Island | Medium | 73.8% | 62.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Remove Sub-Folders from the Filesystem | Medium | 78.6% | 62.5% | ArrayStringDepth-First Search+1 |
| Top K Frequent Elements | Medium | 65.8% | 62.5% | ArrayHash TableDivide and Conquer+5 |
| Parallel Courses | Medium | 62.0% | 62.5% | |
| Web Crawler Multithreaded | Medium | 51.0% | 62.5% | |
| Web Crawler | Medium | 68.9% | 62.5% | |
| Merge Two Sorted Lists | Easy | 67.9% | 50.0% | Linked ListRecursion |
| Swap Nodes in Pairs | Medium | 68.9% | 50.0% | Linked ListRecursion |
| Reverse Nodes in k-Group | Hard | 65.3% | 50.0% | Linked ListRecursion |
| Populating Next Right Pointers in Each Node | Medium | 66.8% | 50.0% | Linked ListTreeDepth-First Search+2 |
| Basic Calculator II | Medium | 46.6% | 50.0% | MathStringStack |
| Encode and Decode Strings | Medium | 51.2% | 50.0% | |
| Integer to English Words | Hard | 34.8% | 50.0% | MathStringRecursion |
| Cheapest Flights Within K Stops | Medium | 41.4% | 50.0% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |
| Leaf-Similar Trees | Easy | 70.2% | 50.0% | TreeDepth-First SearchBinary Tree |
| Min Stack | Medium | 57.7% | 50.0% | StackDesign |
| Random Pick with Weight | Medium | 48.9% | 50.0% | ArrayMathBinary Search+2 |
| Find Median from Data Stream | Hard | 54.2% | 50.0% | Two PointersDesignSorting+2 |
| Task Scheduler | Medium | 62.6% | 50.0% | ArrayHash TableGreedy+3 |
| N-Queens II | Hard | 78.1% | 50.0% | Backtracking |
| Snapshot Array | Medium | 36.7% | 50.0% | ArrayHash TableBinary Search+1 |
| Longest Univalue Path | Medium | 43.5% | 50.0% | TreeDepth-First SearchBinary Tree |
| Single Element in a Sorted Array | Medium | 59.2% | 50.0% | ArrayBinary Search |
| Maximum Number of Events That Can Be Attended | Medium | 38.9% | 50.0% | ArrayGreedySorting+1 |
| Design Add and Search Words Data Structure | Medium | 48.1% | 50.0% | StringDepth-First SearchDesign+1 |
| Remove K Digits | Medium | 36.4% | 50.0% | StringStackGreedy+1 |
| Simplify Path | Medium | 50.0% | 50.0% | StringStack |
| Reverse Only Letters | Easy | 68.1% | 50.0% | Two PointersString |
| Most Stones Removed with Same Row or Column | Medium | 62.7% | 50.0% | Hash TableDepth-First SearchUnion-Find+1 |
| Keys and Rooms | Medium | 75.5% | 50.0% | Depth-First SearchBreadth-First SearchGraph Theory |
| Maximum Number of Events That Can Be Attended II | Hard | 63.6% | 50.0% | ArrayBinary SearchDynamic Programming+1 |
| Design Log Storage System | Medium | 59.2% | 50.0% | |
| Rotting Oranges | Medium | 58.1% | 50.0% | ArrayBreadth-First SearchMatrix |
| Graph Valid Tree | Medium | 49.8% | 50.0% | |
| Shortest Word Distance | Easy | 66.2% | 50.0% | |
| Minimum Operations to Make Numbers Non-positive | Hard | 44.0% | 37.5% | |
| Cherry Pickup | Hard | 39.1% | 37.5% | ArrayDynamic ProgrammingMatrix |
| Meeting Rooms II | Medium | 52.5% | 37.5% | |
| Patching Array | Hard | 54.1% | 37.5% | ArrayGreedy |
| Evaluate Division | Medium | 64.0% | 37.5% | ArrayStringDepth-First Search+4 |
| Maximum Number of Removable Characters | Medium | 46.8% | 37.5% | ArrayTwo PointersString+1 |
| Count Nodes Equal to Average of Subtree | Medium | 86.7% | 37.5% | TreeDepth-First SearchBinary Tree |
| Remove Invalid Parentheses | Hard | 49.8% | 37.5% | StringBacktrackingBreadth-First Search |
| Container With Most Water | Medium | 59.5% | 37.5% | ArrayTwo PointersGreedy |
| Word Break | Medium | 49.1% | 37.5% | ArrayHash TableString+3 |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.3% | 37.5% | ArrayHash TableDivide and Conquer+2 |
| Most Profitable Path in a Tree | Medium | 67.3% | 37.5% | ArrayTreeDepth-First Search+2 |
| Valid Word Abbreviation | Easy | 37.0% | 37.5% | |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 37.5% | Hash TableStringDesign+1 |
| Walls and Gates | Medium | 63.8% | 37.5% | |
| N-Queens | Hard | 74.9% | 37.5% | ArrayBacktracking |
| Path With Minimum Effort | Medium | 62.8% | 37.5% | ArrayBinary SearchDepth-First Search+4 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 37.5% | ArrayDynamic Programming |
| Roman to Integer | Easy | 66.2% | 37.5% | Hash TableMathString |
| Making A Large Island | Hard | 56.3% | 37.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Non-overlapping Intervals | Medium | 56.7% | 37.5% | ArrayDynamic ProgrammingGreedy+1 |
| Valid Sudoku | Medium | 64.1% | 37.5% | ArrayHash TableMatrix |
| Boats to Save People | Medium | 61.4% | 37.5% | ArrayTwo PointersGreedy+1 |
| Word Search | Medium | 46.8% | 37.5% | ArrayStringBacktracking+2 |
| My Calendar I | Medium | 58.2% | 37.5% | ArrayBinary SearchDesign+2 |
| Alert Using Same Key-Card Three or More Times in a One Hour Period | Medium | 46.1% | 37.5% | ArrayHash TableString+1 |
| Design Circular Queue | Medium | 54.0% | 37.5% | ArrayLinked ListDesign+1 |
| Design File System | Medium | 65.1% | 37.5% | |
| Paint Fence | Medium | 48.3% | 37.5% | |
| Add Two Numbers | Medium | 47.9% | 37.5% | Linked ListMathRecursion |
| Parallel Courses II | Hard | 30.5% | 37.5% | Dynamic ProgrammingBit ManipulationGraph Theory+1 |
| Jump Game II | Medium | 42.4% | 37.5% | ArrayDynamic ProgrammingGreedy |
| The Maze | Medium | 60.3% | 37.5% | |
| Campus Bikes | Medium | 59.1% | 37.5% | |
| Height of Binary Tree After Subtree Removal Queries | Hard | 54.9% | 37.5% | ArrayTreeDepth-First Search+2 |