| Apply Operations to Make Two Strings Equal | Medium | 27.6% | 100.0% | StringDynamic Programming |
| Split Array Largest Sum | Hard | 59.9% | 82.7% | ArrayBinary SearchDynamic Programming+2 |
| Minimum Window Substring | Hard | 47.0% | 77.1% | Hash TableStringSliding Window |
| Capacity To Ship Packages Within D Days | Medium | 73.5% | 70.0% | ArrayBinary Search |
| Trapping Rain Water | Hard | 66.8% | 70.0% | ArrayTwo PointersDynamic Programming+2 |
| Palindrome Partitioning II | Hard | 36.6% | 70.0% | StringDynamic Programming |
| Task Scheduler | Medium | 62.7% | 70.0% | ArrayHash TableGreedy+3 |
| Remove Boxes | Hard | 49.3% | 70.0% | ArrayDynamic ProgrammingMemoization |
| Next Greater Element II | Medium | 67.9% | 59.9% | ArrayStackMonotonic Stack |
| Reverse Nodes in k-Group | Hard | 65.4% | 59.9% | Linked ListRecursion |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 59.9% | Hash TableStringSliding Window |
| Maximal Rectangle | Hard | 58.1% | 59.9% | ArrayDynamic ProgrammingStack+2 |
| Count Univalue Subtrees | Medium | 57.5% | 59.9% | TreeDepth-First SearchBinary Tree |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 59.9% | ArrayHash TableMath+2 |
| Remove K Digits | Medium | 36.4% | 59.9% | StringStackGreedy+1 |
| Heaters | Medium | 41.4% | 59.9% | ArrayTwo PointersBinary Search+1 |
| Maximum Subarray | Medium | 53.0% | 59.9% | ArrayDivide and ConquerDynamic Programming |
| Find All Possible Recipes from Given Supplies | Medium | 56.8% | 59.9% | ArrayHash TableString+2 |
| Sliding Window Maximum | Hard | 48.5% | 59.9% | ArrayQueueSliding Window+2 |
| Minimize the Maximum Difference of Pairs | Medium | 50.9% | 59.9% | ArrayBinary SearchDynamic Programming+2 |
| Binary Tree Cameras | Hard | 47.6% | 59.9% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Shifting Letters II | Medium | 53.5% | 59.9% | ArrayStringPrefix Sum |
| Partition to K Equal Sum Subsets | Medium | 38.4% | 59.9% | ArrayDynamic ProgrammingBacktracking+3 |
| Guess Number Higher or Lower II | Medium | 52.5% | 59.9% | MathDynamic ProgrammingGame Theory |
| Merge Intervals | Medium | 51.2% | 59.9% | ArraySorting |
| Median of Two Sorted Arrays | Hard | 46.0% | 59.9% | ArrayBinary SearchDivide and Conquer |
| Distribute Coins in Binary Tree | Medium | 77.3% | 59.9% | TreeDepth-First SearchBinary Tree |
| Power Grid Maintenance | Medium | 56.3% | 59.9% | ArrayHash TableDepth-First Search+5 |
| Word Break | Medium | 49.1% | 59.9% | ArrayHash TableString+3 |
| House Robber | Medium | 52.9% | 59.9% | ArrayDynamic Programming |