| 2681 | Power of Heroes | Hard |
| 2699 | Modify Graph Edge Weights | Hard |
| 2709 | Greatest Common Divisor Traversal | Hard |
| 2713 | Maximum Strictly Increasing Cells in a Matrix | Hard |
| 2719 | Count of Integers | Hard |
| 2732 | Find a Good Subset of the Matrix | Hard |
| 2736 | Maximum Sum Queries | Hard |
| 2742 | Painting the Walls | Hard |
| 2751 | Robot Collisions | Hard |
| 2763 | Sum of Imbalance Numbers of All Subarrays | Hard |
| 2781 | Length of the Longest Valid Substring | Hard |
| 2790 | Maximum Number of Groups With Increasing Length | Hard |
| 2791 | Count Paths That Can Form a Palindrome in a Tree | Hard |
| 2801 | Count Stepping Numbers in Range | Hard |
| 2809 | Minimum Time to Make Array Sum At Most x | Hard |
| 2813 | Maximum Elegance of a K-Length Subsequence | Hard |
| 2818 | Apply Operations to Maximize Score | Hard |
| 2827 | Number of Beautiful Integers in the Range | Hard |
| 2835 | Minimum Operations to Form Subsequence With Target Sum | Hard |
| 2836 | Maximize Value of Function in a Ball Passing Game | Hard |
| 2842 | Count K-Subsequences of a String With Maximum Beauty | Hard |
| 2846 | Minimum Edge Weight Equilibrium Queries in a Tree | Hard |
| 2851 | String Transformation | Hard |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | Hard |
| 2862 | Maximum Element-Sum of a Complete Subset of Indices | Hard |