| 2532 | Time to Cross a Bridge | ArrayHeap (Priority Queue)Simulation | Hard |
| 2538 | Difference Between Maximum and Minimum Price Sum | ArrayDynamic ProgrammingTree+1 | Hard |
| 2543 | Check if Point Is Reachable | MathNumber Theory | Hard |
| 2547 | Minimum Cost to Split an Array | ArrayHash TableDynamic Programming+1 | Hard |
| 2551 | Put Marbles in Bags | ArrayGreedySorting+1 | Hard |
| 2552 | Count Increasing Quadruplets | ArrayDynamic ProgrammingBinary Indexed Tree+2 | Hard |
| 2561 | Rearranging Fruits | ArrayHash TableGreedy+1 | Hard |
| 2565 | Subsequence With the Minimum Score | Two PointersStringBinary Search | Hard |
| 2569 | Handling Sum Queries After Update | ArraySegment Tree | Hard |
| 2573 | Find the String with LCP | ArrayStringDynamic Programming+3 | Hard |
| 2577 | Minimum Time to Visit a Cell In a Grid | ArrayBreadth-First SearchGraph+3 | Hard |
| 2581 | Count Number of Possible Root Nodes | ArrayHash TableDynamic Programming+2 | Hard |
| 2584 | Split the Array to Make Coprime Products | ArrayHash TableMath+1 | Hard |
| 2585 | Number of Ways to Earn Points | ArrayDynamic Programming | Hard |
| 2589 | Minimum Time to Complete All Tasks | ArrayBinary SearchStack+2 | Hard |
| 2603 | Collect Coins in a Tree | ArrayTreeGraph+1 | Hard |
| 2608 | Shortest Cycle in a Graph | Breadth-First SearchGraph | Hard |
| 2612 | Minimum Reverse Operations | ArrayBreadth-First SearchOrdered Set | Hard |
| 2617 | Minimum Number of Visited Cells in a Grid | ArrayDynamic ProgrammingStack+5 | Hard |
| 2630 | Memoize II | | Hard |
| 2642 | Design Graph With Shortest Path Calculator | GraphDesignHeap (Priority Queue)+1 | Hard |
| 2646 | Minimize the Total Price of the Trips | ArrayDynamic ProgrammingTree+2 | Hard |
| 2650 | Design Cancellable Function | | Hard |
| 2659 | Make Array Empty | ArrayBinary SearchGreedy+4 | Hard |
| 2663 | Lexicographically Smallest Beautiful String | StringGreedy | Hard |
| 2681 | Power of Heroes | ArrayMathDynamic Programming+2 | Hard |
| 2699 | Modify Graph Edge Weights | GraphHeap (Priority Queue)Shortest Path | Hard |
| 2709 | Greatest Common Divisor Traversal | ArrayMathUnion Find+1 | Hard |
| 2713 | Maximum Strictly Increasing Cells in a Matrix | ArrayHash TableBinary Search+5 | Hard |
| 2719 | Count of Integers | MathStringDynamic Programming | Hard |
| 2732 | Find a Good Subset of the Matrix | ArrayHash TableBit Manipulation+1 | Hard |
| 2736 | Maximum Sum Queries | ArrayBinary SearchStack+4 | Hard |
| 2742 | Painting the Walls | ArrayDynamic Programming | Hard |
| 2751 | Robot Collisions | ArrayStackSorting+1 | Hard |
| 2763 | Sum of Imbalance Numbers of All Subarrays | ArrayHash TableOrdered Set | Hard |
| 2781 | Length of the Longest Valid Substring | ArrayHash TableString+1 | Hard |
| 2790 | Maximum Number of Groups With Increasing Length | ArrayMathBinary Search+2 | Hard |
| 2791 | Count Paths That Can Form a Palindrome in a Tree | Dynamic ProgrammingBit ManipulationTree+2 | Hard |
| 2801 | Count Stepping Numbers in Range | StringDynamic Programming | Hard |
| 2809 | Minimum Time to Make Array Sum At Most x | ArrayDynamic ProgrammingSorting | Hard |
| 2813 | Maximum Elegance of a K-Length Subsequence | ArrayHash TableStack+3 | Hard |
| 2818 | Apply Operations to Maximize Score | ArrayMathStack+4 | Hard |
| 2827 | Number of Beautiful Integers in the Range | MathDynamic Programming | Hard |
| 2835 | Minimum Operations to Form Subsequence With Target Sum | ArrayGreedyBit Manipulation | Hard |
| 2836 | Maximize Value of Function in a Ball Passing Game | ArrayDynamic ProgrammingBit Manipulation | Hard |
| 2842 | Count K-Subsequences of a String With Maximum Beauty | Hash TableMathString+2 | Hard |
| 2846 | Minimum Edge Weight Equilibrium Queries in a Tree | ArrayTreeGraph+1 | Hard |
| 2851 | String Transformation | MathStringDynamic Programming+1 | Hard |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | Dynamic ProgrammingDepth-First SearchBreadth-First Search+1 | Hard |
| 2862 | Maximum Element-Sum of a Complete Subset of Indices | ArrayMathNumber Theory | Hard |