| Minimum Edge Weight Equilibrium Queries in a Tree | HARD | | ArrayDynamic ProgrammingBit ManipulationTreeDepth-First Search | |
| Number of Great Partitions | HARD | | ArrayDynamic Programming | |
| Apply Bitwise Operations to Make Strings Equal | MEDIUM | | StringBit Manipulation | |
| Apply Operations on Array to Maximize Sum of Squares | HARD | | ArrayHash TableGreedyBit Manipulation | |
| Next Greater Numerically Balanced Number | MEDIUM | | Hash TableMathBacktrackingCountingEnumeration | |
| Max Points on a Line | HARD | | ArrayHash TableMathGeometry | |
| Count the Number of Powerful Integers | HARD | | MathStringDynamic Programming | |
| Number of Same-End Substrings | MEDIUM | | ArrayHash TableStringCountingPrefix Sum | |
| Asteroid Collision | MEDIUM | | ArrayStackSimulation | |
| Minimum Time to Revert Word to Initial State II | HARD | | StringRolling HashString MatchingHash Function | |
| Minimum Time to Revert Word to Initial State I | MEDIUM | | StringRolling HashString MatchingHash Function | |
| Closest Subsequence Sum | HARD | | ArrayTwo PointersDynamic ProgrammingBit ManipulationSortingBitmask | |
| Maximum Subarray Sum After One Operation | MEDIUM | | ArrayDynamic Programming | |
| Maximize Score After N Operations | HARD | | ArrayMathDynamic ProgrammingBacktrackingBit ManipulationNumber TheoryBitmask | |
| Choose Edges to Maximize Score in a Tree | MEDIUM | | Dynamic ProgrammingTreeDepth-First Search | |
| Create Components With Same Value | HARD | | ArrayMathTreeDepth-First SearchEnumeration | |
| First Missing Positive | HARD | | ArrayHash Table | |
| Maximum Score of Non-overlapping Intervals | HARD | | ArrayBinary SearchDynamic ProgrammingSorting | |
| Sum of Subarray Minimums | MEDIUM | | ArrayDynamic ProgrammingStackMonotonic Stack | |
| Odd Even Jump | HARD | | ArrayDynamic ProgrammingStackSortingMonotonic StackOrdered Set | |