| 2376 | Count Special Integers | Hard |
| 2380 | Time Needed to Rearrange a Binary String | Medium |
| 2400 | Number of Ways to Reach a Position After Exactly k Steps | Medium |
| 2435 | Paths in Matrix Whose Sum Is Divisible by K | Hard |
| 2463 | Minimum Total Distance Traveled | Hard |
| 2466 | Count Ways To Build Good Strings | Medium |
| 2472 | Maximum Number of Non-overlapping Palindrome Substrings | Hard |
| 2478 | Number of Beautiful Partitions | Hard |
| 2484 | Count Palindromic Subsequences | Hard |
| 2501 | Longest Square Streak in an Array | Medium |
| 2518 | Number of Great Partitions | Hard |
| 2522 | Partition String Into Substrings With Values at Most K | Medium |
| 2538 | Difference Between Maximum and Minimum Price Sum | Hard |
| 2547 | Minimum Cost to Split an Array | Hard |
| 2552 | Count Increasing Quadruplets | Hard |
| 2556 | Disconnect Path in a Binary Matrix by at Most One Flip | Medium |
| 2571 | Minimum Operations to Reduce an Integer to 0 | Medium |
| 2572 | Count the Number of Square-Free Subsets | Medium |
| 2573 | Find the String with LCP | Hard |
| 2581 | Count Number of Possible Root Nodes | Hard |
| 2585 | Number of Ways to Earn Points | Hard |
| 2597 | The Number of Beautiful Subsets | Medium |
| 2606 | Find the Substring With Maximum Cost | Medium |
| 2617 | Minimum Number of Visited Cells in a Grid | Hard |
| 2645 | Minimum Additions to Make Valid String | Medium |
| 2646 | Minimize the Total Price of the Trips | Hard |
| 2673 | Make Costs of Paths Equal in a Binary Tree | Medium |
| 2684 | Maximum Number of Moves in a Grid | Medium |
| 2707 | Extra Characters in a String | Medium |
| 2712 | Minimum Cost to Make All Characters Equal | Medium |