| Count and Say | Medium | 62.3% | 100.0% | String |
| Reconstruct Itinerary | Hard | 44.3% | 94.8% | Depth-First SearchGraphEulerian Circuit |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 93.4% | ArrayBreadth-First SearchMatrix |
| Optimal Account Balancing | Hard | 50.3% | 92.4% | ArrayDynamic ProgrammingBacktracking+2 |
| Count Subarrays With Score Less Than K | Hard | 62.3% | 90.8% | ArrayBinary SearchSliding Window+1 |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 89.6% | ArrayBinary SearchDynamic Programming+1 |
| Bus Routes | Hard | 47.1% | 85.7% | ArrayHash TableBreadth-First Search |
| Expression Add Operators | Hard | 42.8% | 85.0% | MathStringBacktracking |
| Find Median from Data Stream | Hard | 54.2% | 78.8% | Two PointersDesignSorting+2 |
| Shortest Way to Form String | Medium | 61.6% | 76.6% | Two PointersStringBinary Search+1 |
| Is Subsequence | Easy | 48.9% | 74.2% | Two PointersStringDynamic Programming |
| Reorganize String | Medium | 56.8% | 72.8% | Hash TableStringGreedy+3 |
| Design Search Autocomplete System | Hard | 49.7% | 69.8% | StringDepth-First SearchDesign+4 |
| Longest Word in Dictionary | Medium | 54.5% | 69.8% | ArrayHash TableString+2 |
| Find Median Given Frequency of Numbers | Hard | 42.3% | 66.2% | Database |
| Jump Game III | Medium | 66.7% | 64.2% | ArrayDepth-First SearchBreadth-First Search |
| Coin Change | Medium | 48.0% | 61.9% | ArrayDynamic ProgrammingBreadth-First Search |
| Find K-th Smallest Pair Distance | Hard | 46.3% | 61.9% | ArrayTwo PointersBinary Search+1 |
| Meeting Rooms III | Hard | 51.6% | 59.2% | ArrayHash TableSorting+2 |
| String Compression | Medium | 59.6% | 59.2% | Two PointersString |
| Sparse Matrix Multiplication | Medium | 69.2% | 59.2% | ArrayHash TableMatrix |
| Target Sum | Medium | 51.9% | 56.2% | ArrayDynamic ProgrammingBacktracking |
| Unique Paths II | Medium | 44.2% | 56.2% | ArrayDynamic ProgrammingMatrix |
| Minimize Result by Adding Parentheses to Expression | Medium | 68.2% | 52.7% | StringEnumeration |
| Employee Free Time | Hard | 72.8% | 48.3% | ArrayLine SweepSorting+1 |
| Is Graph Bipartite? | Medium | 58.9% | 48.3% | Depth-First SearchBreadth-First SearchUnion Find+1 |
| Unique Paths III | Hard | 82.8% | 48.3% | ArrayBacktrackingBit Manipulation+1 |
| The Number of Weak Characters in the Game | Medium | 44.5% | 48.3% | ArrayStackGreedy+2 |
| Split Array Largest Sum | Hard | 59.9% | 42.7% | ArrayBinary SearchDynamic Programming+2 |
| Accounts Merge | Medium | 60.9% | 42.7% | ArrayHash TableString+4 |
| Combination Sum | Medium | 76.1% | 42.7% | ArrayBacktracking |
| Top K Frequent Elements | Medium | 65.9% | 42.7% | ArrayHash TableDivide and Conquer+5 |
| Letter Combinations of a Phone Number | Medium | 65.5% | 42.7% | Hash TableStringBacktracking |
| Single Element in a Sorted Array | Medium | 59.2% | 42.7% | ArrayBinary Search |
| Meeting Rooms II | Medium | 52.6% | 42.7% | ArrayTwo PointersGreedy+3 |
| Possible Bipartition | Medium | 52.4% | 42.7% | Depth-First SearchBreadth-First SearchUnion Find+1 |
| Multiply Strings | Medium | 43.6% | 42.7% | MathStringSimulation |
| Find Minimum Time to Finish All Jobs | Hard | 45.4% | 34.9% | ArrayDynamic ProgrammingBacktracking+2 |
| Snakes and Ladders | Medium | 48.0% | 34.9% | ArrayBreadth-First SearchMatrix |
| Shortest Path to Get All Keys | Hard | 54.3% | 34.9% | ArrayBit ManipulationBreadth-First Search+1 |
| Number of Islands | Medium | 63.8% | 34.9% | ArrayDepth-First SearchBreadth-First Search+2 |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 34.9% | Hash TableStringDesign+1 |
| Sudoku Solver | Hard | 65.4% | 34.9% | ArrayHash TableBacktracking+1 |
| The Maze | Medium | 60.3% | 34.9% | ArrayDepth-First SearchBreadth-First Search+1 |
| Find the Celebrity | Medium | 48.9% | 34.9% | Two PointersGraphInteractive |
| Find First and Last Position of Element in Sorted Array | Medium | 48.4% | 34.9% | ArrayBinary Search |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 34.9% | ArrayHash TableTwo Pointers+1 |
| Candy Crush | Medium | 77.3% | 34.9% | ArrayTwo PointersMatrix+1 |
| Smallest Range Covering Elements from K Lists | Hard | 70.1% | 34.9% | ArrayHash TableGreedy+3 |