| 2508 | Add Edges to Make Degrees of All Nodes Even | Hard |
| 2509 | Cycle Length Queries in a Tree | Hard |
| 2514 | Count Anagrams | Hard |
| 2518 | Number of Great Partitions | Hard |
| 2528 | Maximize the Minimum Powered City | Hard |
| 2532 | Time to Cross a Bridge | Hard |
| 2538 | Difference Between Maximum and Minimum Price Sum | Hard |
| 2543 | Check if Point Is Reachable | Hard |
| 2547 | Minimum Cost to Split an Array | Hard |
| 2551 | Put Marbles in Bags | Hard |
| 2552 | Count Increasing Quadruplets | Hard |
| 2561 | Rearranging Fruits | Hard |
| 2565 | Subsequence With the Minimum Score | Hard |
| 2569 | Handling Sum Queries After Update | Hard |
| 2573 | Find the String with LCP | Hard |
| 2577 | Minimum Time to Visit a Cell In a Grid | Hard |
| 2581 | Count Number of Possible Root Nodes | Hard |
| 2584 | Split the Array to Make Coprime Products | Hard |
| 2585 | Number of Ways to Earn Points | Hard |
| 2589 | Minimum Time to Complete All Tasks | Hard |
| 2603 | Collect Coins in a Tree | Hard |
| 2608 | Shortest Cycle in a Graph | Hard |
| 2612 | Minimum Reverse Operations | Hard |
| 2617 | Minimum Number of Visited Cells in a Grid | Hard |
| 2630 | Memoize II | Hard |
| 2642 | Design Graph With Shortest Path Calculator | Hard |
| 2646 | Minimize the Total Price of the Trips | Hard |
| 2650 | Design Cancellable Function | Hard |
| 2659 | Make Array Empty | Hard |
| 2663 | Lexicographically Smallest Beautiful String | Hard |