| Maximum Genetic Difference Query | HARD | | ArrayHash TableBit ManipulationDepth-First SearchTrie | |
| Minimum Total Space Wasted With K Resizing Operations | MEDIUM | | ArrayDynamic ProgrammingPrefix Sum | |
| Trapping Rain Water | HARD | | ArrayTwo PointersDynamic ProgrammingStackMonotonic Stack | |
| Minimum Cost to Buy Apples | MEDIUM | | ArrayGraph TheoryHeap (Priority Queue)Shortest Path | |
| Maximum XOR of Two Non-Overlapping Subtrees | HARD | | TreeDepth-First SearchGraph TheoryTrie | |
| Difference Between Maximum and Minimum Price Sum | HARD | | ArrayDynamic ProgrammingTreeDepth-First Search | |
| Sum of Remoteness of All Cells | MEDIUM | | ArrayHash TableDepth-First SearchBreadth-First SearchUnion-FindMatrix | |
| Maximum Value of an Ordered Triplet II | MEDIUM | | Array | |
| Maximum Value of an Ordered Triplet I | EASY | | Array | |
| Count the Number of Square-Free Subsets | MEDIUM | | ArrayMathDynamic ProgrammingBit ManipulationNumber TheoryBitmask | |
| Furthest Building You Can Reach | MEDIUM | | ArrayGreedyHeap (Priority Queue) | |
| Queens That Can Attack the King | MEDIUM | | ArrayMatrixSimulation | |
| Minimum Time Visiting All Points | EASY | | ArrayMathGeometry | |
| Make the XOR of All Segments Equal to Zero | HARD | | ArrayHash TableDynamic ProgrammingBit ManipulationCounting | |
| Minimum XOR Sum of Two Arrays | HARD | | ArrayDynamic ProgrammingBit ManipulationBitmask | |
| Minimum Operations to Form Subsequence With Target Sum | HARD | | ArrayGreedyBit Manipulation | |
| Maximum Segment Sum After Removals | HARD | | ArrayUnion-FindPrefix SumOrdered Set | |
| Trapping Rain Water II | HARD | | ArrayBreadth-First SearchHeap (Priority Queue)Matrix | |
| Time Needed to Inform All Employees | MEDIUM | | TreeDepth-First SearchBreadth-First Search | |
| Kth Smallest Number in Multiplication Table | HARD | | MathBinary Search | |