| Design Authentication Manager | Medium | 58.4% | 100.0% | Hash TableLinked ListDesign+1 |
| Count Non Decreasing Arrays With Given Digit Sums | Hard | | 100.0% | ArrayDynamic ProgrammingPrefix Sum |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 87.6% | Hash TableStringDesign+1 |
| Find Maximum Area of a Triangle | Medium | 29.1% | 87.6% | ArrayHash TableMath+3 |
| LRU Cache | Medium | 46.8% | 81.7% | Hash TableLinked ListDesign+1 |
| Merge Intervals | Medium | 51.2% | 81.7% | ArraySorting |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 81.7% | ArrayHash TableMath+2 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 81.7% | Hash TableStringSliding Window |
| Search Suggestions System | Medium | 65.1% | 81.7% | ArrayStringBinary Search+3 |
| Find Median from Data Stream | Hard | 54.2% | 74.1% | Two PointersDesignSorting+2 |
| Inorder Successor in BST | Medium | 51.1% | 74.1% | TreeDepth-First SearchBinary Search Tree+1 |
| Integer to Roman | Medium | 70.5% | 74.1% | Hash TableMathString |
| Number of Islands | Medium | 63.8% | 74.1% | ArrayDepth-First SearchBreadth-First Search+2 |
| Top K Frequent Elements | Medium | 65.9% | 74.1% | ArrayHash TableDivide and Conquer+5 |
| Logger Rate Limiter | Easy | 76.8% | 74.1% | Hash TableDesignData Stream |
| Group Anagrams | Medium | 72.2% | 74.1% | ArrayHash TableString+1 |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 63.4% | ArrayBinary SearchDynamic Programming+1 |
| Trapping Rain Water | Hard | 66.8% | 63.4% | ArrayTwo PointersDynamic Programming+2 |
| Copy List with Random Pointer | Medium | 62.4% | 63.4% | Hash TableLinked List |
| Excel Sheet Column Number | Easy | 67.3% | 63.4% | MathString |
| Shortest Bridge | Medium | 59.3% | 63.4% | ArrayDepth-First SearchBreadth-First Search+1 |
| Count Good Nodes in Binary Tree | Medium | 73.8% | 63.4% | TreeDepth-First SearchBreadth-First Search+1 |
| Number of Atoms | Hard | 65.1% | 63.4% | Hash TableStringStack+1 |
| House Robber III | Medium | 55.6% | 63.4% | Dynamic ProgrammingTreeDepth-First Search+1 |
| House Robber II | Medium | 44.6% | 63.4% | ArrayDynamic Programming |
| Meeting Rooms II | Medium | 52.6% | 63.4% | ArrayTwo PointersGreedy+3 |
| Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 70.9% | 63.4% | ArrayBreadth-First SearchGraph Theory+3 |
| Word Ladder | Hard | 44.9% | 63.4% | Hash TableStringBreadth-First Search |
| Longest Repeating Character Replacement | Medium | 59.1% | 63.4% | Hash TableStringSliding Window |
| Merge Two Sorted Lists | Easy | 68.0% | 63.4% | Linked ListRecursion |
| Task Scheduler | Medium | 62.7% | 63.4% | ArrayHash TableGreedy+3 |
| Spiral Matrix IV | Medium | 82.3% | 63.4% | ArrayLinked ListMatrix+1 |
| Find All Possible Recipes from Given Supplies | Medium | 56.8% | 63.4% | ArrayHash TableString+2 |
| Binary Tree Level Order Traversal | Medium | 72.2% | 63.4% | TreeBreadth-First SearchBinary Tree |
| Find Peak Element | Medium | 46.8% | 63.4% | ArrayBinary Search |
| Accounts Merge | Medium | 60.9% | 63.4% | ArrayHash TableString+4 |