| Reconstruct Itinerary | Hard | 44.3% | 100.0% | ArrayStringDepth-First Search+4 |
| Optimal Account Balancing | Hard | 50.3% | 100.0% | |
| Count and Say | Medium | 62.3% | 87.5% | String |
| Expression Add Operators | Hard | 42.8% | 87.5% | MathStringBacktracking |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 87.5% | ArrayBinary SearchDynamic Programming+1 |
| Count Subarrays With Score Less Than K | Hard | 62.3% | 87.5% | ArrayBinary SearchSliding Window+1 |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 87.5% | ArrayBreadth-First SearchMatrix |
| Bus Routes | Hard | 47.1% | 87.5% | ArrayHash TableBreadth-First Search |
| Shortest Way to Form String | Medium | 61.5% | 75.0% | |
| Find Median from Data Stream | Hard | 54.2% | 75.0% | Two PointersDesignSorting+2 |
| Coin Change | Medium | 47.9% | 75.0% | ArrayDynamic ProgrammingBreadth-First Search |
| Is Subsequence | Easy | 48.8% | 75.0% | Two PointersStringDynamic Programming |
| Longest Word in Dictionary | Medium | 54.5% | 75.0% | ArrayHash TableString+2 |
| Sparse Matrix Multiplication | Medium | 69.2% | 62.5% | |
| Find Median Given Frequency of Numbers | Hard | 42.3% | 62.5% | |
| Design Search Autocomplete System | Hard | 49.7% | 62.5% | |
| Reorganize String | Medium | 56.8% | 62.5% | Hash TableStringGreedy+3 |
| Meeting Rooms III | Hard | 51.7% | 62.5% | ArrayHash TableSorting+2 |
| Target Sum | Medium | 51.8% | 62.5% | ArrayDynamic ProgrammingBacktracking |
| String Compression | Medium | 59.5% | 50.0% | Two PointersString |
| Multiply Strings | Medium | 43.5% | 50.0% | MathStringSimulation |
| Combination Sum | Medium | 76.1% | 50.0% | ArrayBacktracking |
| Split Array Largest Sum | Hard | 59.8% | 50.0% | ArrayBinary SearchDynamic Programming+2 |
| Find Minimum Time to Finish All Jobs | Hard | 45.3% | 50.0% | ArrayDynamic ProgrammingBacktracking+2 |
| Put Boxes Into the Warehouse II | Medium | 65.8% | 50.0% | |
| Put Boxes Into the Warehouse I | Medium | 67.4% | 50.0% | |
| Delete Nodes And Return Forest | Medium | 72.5% | 50.0% | ArrayHash TableTree+2 |
| Letter Combinations of a Phone Number | Medium | 65.5% | 37.5% | Hash TableStringBacktracking |
| Unique Paths II | Medium | 44.1% | 37.5% | ArrayDynamic ProgrammingMatrix |
| The Number of Weak Characters in the Game | Medium | 44.5% | 37.5% | ArrayStackGreedy+2 |
| Meeting Rooms II | Medium | 52.5% | 37.5% | |
| Minimize Result by Adding Parentheses to Expression | Medium | 68.2% | 37.5% | StringEnumeration |
| Possible Bipartition | Medium | 52.3% | 37.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Unique Paths III | Hard | 82.7% | 37.5% | ArrayBacktrackingBit Manipulation+1 |
| Top K Frequent Elements | Medium | 65.8% | 37.5% | ArrayHash TableDivide and Conquer+5 |
| The Maze | Medium | 60.3% | 37.5% | |
| Find the Celebrity | Medium | 48.9% | 37.5% | |
| Find First and Last Position of Element in Sorted Array | Medium | 48.3% | 37.5% | ArrayBinary Search |
| Employee Free Time | Hard | 72.8% | 37.5% | |
| Number of Islands | Medium | 63.8% | 37.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Candy Crush | Medium | 77.3% | 37.5% | |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 37.5% | |
| Accounts Merge | Medium | 60.9% | 37.5% | ArrayHash TableString+4 |
| Merge Intervals | Medium | 51.1% | 37.5% | ArraySorting |
| Text Justification | Hard | 50.4% | 37.5% | ArrayStringSimulation |
| Merge k Sorted Lists | Hard | 58.8% | 37.5% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Number of Provinces | Medium | 70.0% | 37.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Design A Leaderboard | Medium | 68.1% | 37.5% | |