| 2679 | Sum in a Matrix | Medium |
| 2681 | Power of Heroes | Hard |
| 2706 | Buy Two Chocolates | Easy |
| 2708 | Maximum Strength of a Group | Medium |
| 2713 | Maximum Strictly Increasing Cells in a Matrix | Hard |
| 2731 | Movement of Robots | Medium |
| 2733 | Neither Minimum nor Maximum | Easy |
| 2736 | Maximum Sum Queries | Hard |
| 2740 | Find the Value of the Partition | Medium |
| 2747 | Count Zero Request Servers | Medium |
| 2751 | Robot Collisions | Hard |
| 2766 | Relocate Marbles | Medium |
| 2779 | Maximum Beauty of an Array After Applying Operation | Medium |
| 2780 | Minimum Index of a Valid Split | Medium |
| 2784 | Check if Array is Good | Easy |
| 2785 | Sort Vowels in a String | Medium |
| 2790 | Maximum Number of Groups With Increasing Length | Hard |
| 2809 | Minimum Time to Make Array Sum At Most x | Hard |
| 2813 | Maximum Elegance of a K-Length Subsequence | Hard |
| 2824 | Count Pairs Whose Sum is Less than Target | Easy |
| 2830 | Maximize the Profit as the Salesman | Medium |