| Create Components With Same Value | Hard | 53.3% | 100.0% | ArrayMathTree+2 |
| Minimum Edge Weight Equilibrium Queries in a Tree | Hard | 45.4% | 87.5% | ArrayTreeGraph Theory+1 |
| Number of Great Partitions | Hard | 33.3% | 87.5% | ArrayDynamic Programming |
| Apply Bitwise Operations to Make Strings Equal | Medium | 42.5% | 87.5% | StringBit Manipulation |
| Apply Operations on Array to Maximize Sum of Squares | Hard | 44.2% | 87.5% | ArrayHash TableGreedy+1 |
| Next Greater Numerically Balanced Number | Medium | 63.0% | 87.5% | Hash TableMathBacktracking+2 |
| Count the Number of Powerful Integers | Hard | 46.3% | 87.5% | MathStringDynamic Programming |
| Number of Same-End Substrings | Medium | 61.6% | 87.5% | |
| Minimum Time to Revert Word to Initial State II | Hard | 35.0% | 87.5% | StringRolling HashString Matching+1 |
| Minimum Time to Revert Word to Initial State I | Medium | 42.3% | 87.5% | StringRolling HashString Matching+1 |
| Closest Subsequence Sum | Hard | 43.2% | 87.5% | ArrayTwo PointersDynamic Programming+3 |
| Maximum Subarray Sum After One Operation | Medium | 65.2% | 87.5% | |
| Maximize Score After N Operations | Hard | 57.9% | 87.5% | ArrayMathDynamic Programming+4 |
| Choose Edges to Maximize Score in a Tree | Medium | 56.6% | 87.5% | |
| Maximum Score of Non-overlapping Intervals | Hard | 31.0% | 87.5% | ArrayBinary SearchDynamic Programming+1 |
| Sum of Subarray Minimums | Medium | 38.3% | 75.0% | ArrayDynamic ProgrammingStack+1 |
| Isomorphic Strings | Easy | 48.0% | 75.0% | Hash TableString |
| Cherry Pickup II | Hard | 72.3% | 62.5% | ArrayDynamic ProgrammingMatrix |
| Subarray Sum Equals K | Medium | 46.8% | 62.5% | ArrayHash TablePrefix Sum |
| Trapping Rain Water | Hard | 66.8% | 50.0% | ArrayTwo PointersDynamic Programming+2 |
| LRU Cache | Medium | 46.8% | 50.0% | Hash TableLinked ListDesign+1 |
| Max Points on a Line | Hard | 30.2% | 50.0% | ArrayHash TableMath+1 |
| Asteroid Collision | Medium | 47.1% | 50.0% | ArrayStackSimulation |
| Serialize and Deserialize Binary Tree | Hard | 60.3% | 50.0% | StringTreeDepth-First Search+3 |
| First Missing Positive | Hard | 42.4% | 50.0% | ArrayHash Table |
| Odd Even Jump | Hard | 41.1% | 50.0% | ArrayDynamic ProgrammingStack+3 |
| Regular Expression Matching | Hard | 30.4% | 50.0% | StringDynamic ProgrammingRecursion |
| Student Attendance Record II | Hard | 56.4% | 50.0% | Dynamic Programming |
| Shortest Path with Alternating Colors | Medium | 47.7% | 50.0% | Breadth-First SearchGraph Theory |
| Longest Univalue Path | Medium | 43.5% | 50.0% | TreeDepth-First SearchBinary Tree |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 50.0% | ArrayDynamic Programming |
| Maximum Sum Circular Subarray | Medium | 49.4% | 50.0% | ArrayDivide and ConquerDynamic Programming+2 |
| Maximal Rectangle | Hard | 58.1% | 50.0% | ArrayDynamic ProgrammingStack+2 |
| Longest Valid Parentheses | Hard | 38.0% | 50.0% | StringDynamic ProgrammingStack |
| Remove Boxes | Hard | 49.3% | 50.0% | ArrayDynamic ProgrammingMemoization |
| Frog Jump | Hard | 47.1% | 50.0% | ArrayDynamic Programming |
| Find Median from Data Stream | Hard | 54.2% | 50.0% | Two PointersDesignSorting+2 |
| 132 Pattern | Medium | 34.5% | 50.0% | ArrayBinary SearchStack+2 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 50.0% | Hash TableStringSliding Window |
| Validate Stack Sequences | Medium | 70.2% | 50.0% | ArrayStackSimulation |
| House Robber III | Medium | 55.6% | 50.0% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Sliding Window Maximum | Hard | 48.4% | 50.0% | ArrayQueueSliding Window+2 |