| IP to CIDR | Medium | 53.7% | 100.0% | |
| Design Hit Counter | Medium | 69.6% | 100.0% | |
| Step-By-Step Directions From a Binary Tree Node to Another | Medium | 56.4% | 87.5% | StringTreeDepth-First Search+1 |
| House Robber | Medium | 52.9% | 87.5% | ArrayDynamic Programming |
| House Robber II | Medium | 44.6% | 87.5% | ArrayDynamic Programming |
| Design Tic-Tac-Toe | Medium | 58.7% | 87.5% | |
| Time Based Key-Value Store | Medium | 49.7% | 87.5% | Hash TableStringBinary Search+1 |
| Find All Anagrams in a String | Medium | 53.3% | 75.0% | Hash TableStringSliding Window |
| Longest Palindrome by Concatenating Two Letter Words | Medium | 53.5% | 62.5% | ArrayHash TableString+2 |
| Snapshot Array | Medium | 36.7% | 62.5% | ArrayHash TableBinary Search+1 |
| Closest Leaf in a Binary Tree | Medium | 47.4% | 62.5% | |
| Text Justification | Hard | 50.4% | 62.5% | ArrayStringSimulation |
| Split Message Based on Limit | Hard | 42.0% | 62.5% | StringEnumeration |
| Number of Recent Calls | Easy | 78.1% | 62.5% | DesignQueueData Stream |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 62.5% | ArrayBreadth-First SearchMatrix |
| RLE Iterator | Medium | 59.2% | 62.5% | ArrayDesignCounting+1 |
| Unique Paths III | Hard | 82.7% | 50.0% | ArrayBacktrackingBit Manipulation+1 |
| Permutation in String | Medium | 48.4% | 50.0% | Hash TableTwo PointersString+1 |
| Number of Flowers in Full Bloom | Hard | 57.7% | 37.5% | ArrayHash TableBinary Search+3 |
| Find the Length of the Longest Common Prefix | Medium | 57.0% | 37.5% | ArrayHash TableString+1 |
| Finding Pairs With a Certain Sum | Medium | 61.6% | 37.5% | ArrayHash TableDesign |
| Spiral Matrix | Medium | 56.1% | 37.5% | ArrayMatrixSimulation |
| Longest Mountain in Array | Medium | 41.8% | 37.5% | ArrayTwo PointersDynamic Programming+1 |
| String to Integer (atoi) | Medium | 20.6% | 37.5% | String |
| Find Peak Element | Medium | 46.8% | 37.5% | ArrayBinary Search |
| Merge Intervals | Medium | 51.1% | 37.5% | ArraySorting |
| Shortest Path in Binary Matrix | Medium | 51.1% | 37.5% | ArrayBreadth-First SearchMatrix |
| Minimum Cost to Reach Destination in Time | Hard | 41.1% | 37.5% | ArrayDynamic ProgrammingGraph Theory |
| Count Integers in Intervals | Hard | 35.6% | 37.5% | DesignSegment TreeOrdered Set |
| Minimum Knight Moves | Medium | 41.7% | 37.5% | |
| Rotting Oranges | Medium | 58.1% | 37.5% | ArrayBreadth-First SearchMatrix |