| 2596 | Check Knight Tour Configuration | Medium |
| 2597 | The Number of Beautiful Subsets | Medium |
| 2598 | Smallest Missing Non-negative Integer After Operations | Medium |
| 2601 | Prime Subtraction Operation | Medium |
| 2602 | Minimum Operations to Make All Array Elements Equal | Medium |
| 2606 | Find the Substring With Maximum Cost | Medium |
| 2607 | Make K-Subarray Sums Equal | Medium |
| 2610 | Convert an Array Into a 2D Array With Conditions | Medium |
| 2611 | Mice and Cheese | Medium |
| 2615 | Sum of Distances | Medium |
| 2616 | Minimize the Maximum Difference of Pairs | Medium |
| 2618 | Check if Object Instance of Class | Medium |
| 2622 | Cache With Time Limit | Medium |
| 2623 | Memoize | Medium |
| 2624 | Snail Traversal | Medium |
| 2625 | Flatten Deeply Nested Array | Medium |
| 2627 | Debounce | Medium |
| 2631 | Group By | Medium |
| 2640 | Find the Score of All Prefixes of an Array | Medium |
| 2641 | Cousins in Binary Tree II | Medium |
| 2645 | Minimum Additions to Make Valid String | Medium |
| 2649 | Nested Array Generator | Medium |
| 2653 | Sliding Subarray Beauty | Medium |
| 2654 | Minimum Number of Operations to Make All Array Elements Equal to 1 | Medium |
| 2657 | Find the Prefix Common Array of Two Arrays | Medium |
| 2658 | Maximum Number of Fish in a Grid | Medium |
| 2661 | First Completely Painted Row or Column | Medium |
| 2662 | Minimum Cost of a Path With Special Roads | Medium |
| 2671 | Frequency Tracker | Medium |
| 2672 | Number of Adjacent Elements With the Same Color | Medium |