| Minimum Total Space Wasted With K Resizing Operations | Medium | 43.9% | 100.0% | ArrayDynamic ProgrammingPrefix Sum |
| Difference Between Maximum and Minimum Price Sum | Hard | 33.2% | 100.0% | ArrayDynamic ProgrammingTree+1 |
| Count the Number of Square-Free Subsets | Medium | 26.4% | 100.0% | ArrayMathDynamic Programming+2 |
| Trapping Rain Water II | Hard | 64.0% | 100.0% | ArrayBreadth-First SearchHeap (Priority Queue)+1 |
| Maximum Genetic Difference Query | Hard | 46.4% | 87.5% | ArrayHash TableBit Manipulation+2 |
| Minimum Cost to Buy Apples | Medium | 67.2% | 87.5% | |
| Maximum XOR of Two Non-Overlapping Subtrees | Hard | 52.0% | 87.5% | |
| Sum of Remoteness of All Cells | Medium | 70.8% | 87.5% | |
| Maximum Value of an Ordered Triplet II | Medium | 56.4% | 87.5% | Array |
| Maximum Value of an Ordered Triplet I | Easy | 58.2% | 87.5% | Array |
| Furthest Building You Can Reach | Medium | 50.7% | 87.5% | ArrayGreedyHeap (Priority Queue) |
| Queens That Can Attack the King | Medium | 72.6% | 87.5% | ArrayMatrixSimulation |
| Minimum Time Visiting All Points | Easy | 84.8% | 87.5% | ArrayMathGeometry |
| Make the XOR of All Segments Equal to Zero | Hard | 40.9% | 87.5% | ArrayHash TableDynamic Programming+2 |
| Minimum XOR Sum of Two Arrays | Hard | 50.5% | 87.5% | ArrayDynamic ProgrammingBit Manipulation+1 |
| Minimum Operations to Form Subsequence With Target Sum | Hard | 32.3% | 87.5% | ArrayGreedyBit Manipulation |
| Russian Doll Envelopes | Hard | 37.7% | 87.5% | ArrayBinary SearchDynamic Programming+1 |
| Jump Game IX | Medium | 23.8% | 87.5% | ArrayDynamic Programming |
| Trapping Rain Water | Hard | 66.8% | 75.0% | ArrayTwo PointersDynamic Programming+2 |
| Most Stones Removed with Same Row or Column | Medium | 62.7% | 75.0% | Hash TableDepth-First SearchUnion-Find+1 |
| Maximum Segment Sum After Removals | Hard | 49.3% | 62.5% | ArrayUnion-FindPrefix Sum+1 |
| Kth Smallest Number in Multiplication Table | Hard | 53.8% | 62.5% | MathBinary Search |
| Find Maximum Non-decreasing Array Length | Hard | 18.5% | 62.5% | ArrayBinary SearchDynamic Programming+4 |
| Minimum Number of Valid Strings to Form Target I | Medium | 21.7% | 62.5% | ArrayStringBinary Search+6 |
| Climbing Stairs | Easy | 53.9% | 62.5% | MathDynamic ProgrammingMemoization |
| LRU Cache | Medium | 46.8% | 50.0% | Hash TableLinked ListDesign+1 |
| Time Needed to Inform All Employees | Medium | 60.4% | 50.0% | TreeDepth-First SearchBreadth-First Search |
| Queue Reconstruction by Height | Medium | 74.6% | 50.0% | ArrayBinary Indexed TreeSegment Tree+1 |
| The Number of Good Subsets | Hard | 37.1% | 50.0% | ArrayHash TableMath+5 |
| Spiral Matrix | Medium | 56.1% | 50.0% | ArrayMatrixSimulation |
| Making A Large Island | Hard | 56.3% | 50.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Recover Binary Search Tree | Medium | 58.7% | 50.0% | TreeDepth-First SearchBinary Search Tree+1 |
| Sliding Window Maximum | Hard | 48.4% | 50.0% | ArrayQueueSliding Window+2 |