| Integer to Roman | Medium | 70.4% | 100.0% | Hash TableMathString |
| Number of Islands | Medium | 63.8% | 100.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Add Two Numbers | Medium | 47.9% | 87.5% | Linked ListMathRecursion |
| Median of Two Sorted Arrays | Hard | 45.9% | 87.5% | ArrayBinary SearchDivide and Conquer |
| Longest Palindromic Substring | Medium | 37.3% | 87.5% | Two PointersStringDynamic Programming |
| Container With Most Water | Medium | 59.5% | 87.5% | ArrayTwo PointersGreedy |
| Alien Dictionary | Hard | 37.1% | 87.5% | |
| 3Sum | Medium | 38.6% | 87.5% | ArrayTwo PointersSorting |
| Merge Two Sorted Lists | Easy | 67.9% | 87.5% | Linked ListRecursion |
| Move Zeroes | Easy | 63.5% | 87.5% | ArrayTwo Pointers |
| Diameter of Binary Tree | Easy | 65.0% | 87.5% | TreeDepth-First SearchBinary Tree |
| Minimum Distance Between BST Nodes | Easy | 61.1% | 87.5% | TreeDepth-First SearchBreadth-First Search+2 |
| Trapping Rain Water | Hard | 66.8% | 87.5% | ArrayTwo PointersDynamic Programming+2 |
| Design HashSet | Easy | 67.7% | 87.5% | ArrayHash TableLinked List+2 |
| Pow(x, n) | Medium | 38.2% | 87.5% | MathRecursion |
| Maximum Subarray | Medium | 53.0% | 87.5% | ArrayDivide and ConquerDynamic Programming |
| Unique Morse Code Words | Easy | 83.5% | 87.5% | ArrayHash TableString |
| Merge Intervals | Medium | 51.1% | 87.5% | ArraySorting |
| Subdomain Visit Count | Medium | 77.2% | 87.5% | ArrayHash TableString+1 |
| Palindrome Pairs | Hard | 36.9% | 87.5% | ArrayHash TableString+1 |
| Power of Four | Easy | 51.7% | 87.5% | MathBit ManipulationRecursion |
| Intersection of Two Arrays | Easy | 77.5% | 87.5% | ArrayHash TableTwo Pointers+2 |
| Validate Binary Search Tree | Medium | 35.3% | 87.5% | TreeDepth-First SearchBinary Search Tree+1 |
| Longest String Chain | Medium | 62.8% | 87.5% | ArrayHash TableTwo Pointers+3 |
| Search Suggestions System | Medium | 65.2% | 87.5% | ArrayStringBinary Search+3 |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 87.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 87.5% | Hash TableTreeDepth-First Search+2 |
| Clone Graph | Medium | 64.7% | 87.5% | Hash TableDepth-First SearchBreadth-First Search+1 |
| Is Subsequence | Easy | 48.8% | 87.5% | Two PointersStringDynamic Programming |
| Copy List with Random Pointer | Medium | 62.4% | 87.5% | Hash TableLinked List |
| Employees Earning More Than Their Managers | Easy | 72.8% | 87.5% | Database |
| Unique Email Addresses | Easy | 67.8% | 87.5% | ArrayHash TableString |
| Binary Tree Right Side View | Medium | 69.5% | 87.5% | TreeDepth-First SearchBreadth-First Search+1 |
| Verifying an Alien Dictionary | Easy | 55.9% | 87.5% | ArrayHash TableString |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.7% | 87.5% | TreeDepth-First SearchBinary Tree |
| Shortest Word Distance | Easy | 66.2% | 87.5% | |
| K Closest Points to Origin | Medium | 68.7% | 87.5% | ArrayMathDivide and Conquer+4 |
| Invalid Transactions | Medium | 32.1% | 87.5% | ArrayHash TableString+1 |
| Group Shifted Strings | Medium | 67.7% | 87.5% | |
| Rotting Oranges | Medium | 58.1% | 87.5% | ArrayBreadth-First SearchMatrix |
| Decode String | Medium | 62.2% | 75.0% | StringStackRecursion |
| Roman to Integer | Easy | 66.2% | 75.0% | Hash TableMathString |
| Strong Password Checker | Hard | 15.4% | 75.0% | StringGreedyHeap (Priority Queue) |
| Reconstruct Original Digits from English | Medium | 52.7% | 62.5% | Hash TableMathString |
| Word Search II | Hard | 38.1% | 62.5% | ArrayStringBacktracking+2 |
| Subsets | Medium | 82.0% | 62.5% | ArrayBacktrackingBit Manipulation |
| Escape The Ghosts | Medium | 63.4% | 62.5% | ArrayMath |
| As Far from Land as Possible | Medium | 52.2% | 62.5% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Minimum Time Takes to Reach Destination Without Drowning | Hard | 54.5% | 50.0% | |
| Word Search | Medium | 46.8% | 50.0% | ArrayStringBacktracking+2 |
| Find Peak Element | Medium | 46.8% | 50.0% | ArrayBinary Search |
| Count and Say | Medium | 62.3% | 50.0% | String |
| Valid Parentheses | Easy | 43.7% | 50.0% | StringStack |
| Lowest Common Ancestor of a Binary Tree III | Medium | 82.9% | 50.0% | |
| Shortest Distance from All Buildings | Hard | 44.8% | 50.0% | |
| Fibonacci Number | Easy | 73.9% | 50.0% | MathDynamic ProgrammingRecursion+1 |