| Text Justification | Hard | 50.5% | 100.0% | ArrayStringSimulation |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 92.4% | ArrayBinary SearchDynamic Programming+1 |
| Flatten 2D Vector | Medium | 50.4% | 85.9% | ArrayTwo PointersDesign+1 |
| Smallest Common Region | Medium | 68.3% | 84.9% | ArrayHash TableString+3 |
| Palindrome Pairs | Hard | 37.0% | 84.9% | ArrayHash TableString+2 |
| Maximum Candies You Can Get from Boxes | Hard | 67.9% | 83.9% | ArrayBreadth-First SearchGraph Theory |
| Pour Water | Medium | 48.5% | 79.2% | ArraySimulation |
| Sliding Puzzle | Hard | 74.2% | 77.8% | ArrayDynamic ProgrammingBacktracking+3 |
| Design Excel Sum Formula | Hard | 39.9% | 76.4% | ArrayHash TableString+4 |
| Intersection of Two Linked Lists | Easy | 63.2% | 76.4% | Hash TableLinked ListTwo Pointers |
| Trapping Rain Water | Hard | 66.8% | 76.4% | ArrayTwo PointersDynamic Programming+2 |
| Alien Dictionary | Hard | 37.1% | 74.8% | ArrayStringDepth-First Search+3 |
| Contains Duplicate II | Easy | 50.8% | 73.2% | ArrayHash TableSliding Window |
| Simple Bank System | Medium | 69.8% | 71.3% | ArrayHash TableDesign+1 |
| IP to CIDR | Medium | 53.6% | 71.3% | StringBit Manipulation |
| Employee Free Time | Hard | 72.8% | 71.3% | ArraySweep LineSorting+1 |
| Cheapest Flights Within K Stops | Medium | 41.4% | 71.3% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |
| Two Sum | Easy | 57.1% | 71.3% | ArrayHash Table |
| Add Two Numbers | Medium | 48.0% | 71.3% | Linked ListMathRecursion |
| Word Search II | Hard | 38.1% | 71.3% | ArrayStringBacktracking+2 |
| Mini Parser | Medium | 42.0% | 69.3% | StringStackDepth-First Search |
| Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | Hard | 72.4% | 69.3% | ArrayHash TableBit Manipulation+2 |
| Single Number | Easy | 77.4% | 69.3% | ArrayBit Manipulation |
| Regular Expression Matching | Hard | 30.5% | 69.3% | StringDynamic ProgrammingRecursion |
| Valid Parentheses | Easy | 43.7% | 69.3% | StringStack |
| Merge k Sorted Lists | Hard | 58.9% | 69.3% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Minimize Rounding Error to Meet Target | Medium | 45.8% | 69.3% | ArrayMathString+2 |
| Add Strings | Easy | 52.1% | 69.3% | MathStringSimulation |
| Strings Differ by One Character | Medium | 40.1% | 69.3% | Hash TableStringRolling Hash+1 |
| Convert to Base -2 | Medium | 61.8% | 69.3% | Math |
| Reverse Bits | Easy | 67.8% | 69.3% | Divide and ConquerBit Manipulation |
| House Robber | Medium | 52.9% | 69.3% | ArrayDynamic Programming |
| Happy Number | Easy | 59.3% | 69.3% | Hash TableMathTwo Pointers |
| Contains Duplicate | Easy | 64.1% | 69.3% | ArrayHash TableSorting |
| Contains Duplicate III | Hard | 24.5% | 69.3% | ArraySliding WindowSorting+2 |
| Maximal Square | Medium | 50.0% | 69.3% | ArrayDynamic ProgrammingMatrix |
| Robot Bounded In Circle | Medium | 56.5% | 69.3% | MathStringSimulation |
| Basic Calculator II | Medium | 46.7% | 69.3% | MathStringStack |
| Design File System | Medium | 65.1% | 69.3% | Hash TableStringDesign+1 |
| Number of Ways to Build House of Cards | Medium | 62.7% | 69.3% | MathDynamic Programming |
| Convert Sorted Array to Binary Search Tree | Easy | 75.2% | 69.3% | ArrayDivide and ConquerTree+2 |
| Pyramid Transition Matrix | Medium | 60.6% | 69.3% | Hash TableStringBacktracking+1 |
| Minimum Number of Vertices to Reach All Nodes | Medium | 81.5% | 69.3% | Graph Theory |
| Shortest Uncommon Substring in an Array | Medium | 50.0% | 67.1% | ArrayHash TableString+1 |
| Combination Sum | Medium | 76.1% | 67.1% | ArrayBacktracking |
| Shopping Offers | Medium | 52.3% | 64.6% | ArrayDynamic ProgrammingBacktracking+3 |
| Minimum Window Substring | Hard | 47.0% | 64.6% | Hash TableStringSliding Window |
| Accounts Merge | Medium | 60.9% | 54.8% | ArrayHash TableString+4 |
| Design Tic-Tac-Toe | Medium | 58.7% | 54.8% | ArrayHash TableDesign+2 |
| Subarray Product Less Than K | Medium | 53.9% | 54.8% | ArrayBinary SearchSliding Window+1 |
| Shortest Path to Get All Keys | Hard | 54.3% | 50.1% | ArrayBit ManipulationBreadth-First Search+1 |
| All O`one Data Structure | Hard | 44.2% | 44.1% | Hash TableLinked ListDesign+1 |
| Detonate the Maximum Bombs | Medium | 49.9% | 35.8% | ArrayMathDepth-First Search+3 |
| Minimum Cost to Reach Destination in Time | Hard | 41.2% | 35.8% | ArrayDynamic ProgrammingGraph Theory |
| Shortest Path in Binary Matrix | Medium | 51.1% | 35.8% | ArrayBreadth-First SearchMatrix |
| Making A Large Island | Hard | 56.3% | 35.8% | ArrayDepth-First SearchBreadth-First Search+2 |
| Can Place Flowers | Easy | 29.1% | 35.8% | ArrayGreedy |
| Maximum Subarray | Medium | 53.0% | 35.8% | ArrayDivide and ConquerDynamic Programming |
| Time Based Key-Value Store | Medium | 49.7% | 35.8% | Hash TableStringBinary Search+1 |
| Nth Digit | Medium | 37.3% | 35.8% | MathBinary Search |
| Minimum Window Subsequence | Hard | 43.8% | 35.8% | StringDynamic ProgrammingSliding Window |
| Consecutive Numbers Sum | Hard | 42.6% | 35.8% | MathEnumeration |
| Flatten Nested List Iterator | Medium | 65.6% | 35.8% | StackTreeDepth-First Search+3 |
