| 2531 | Make Number of Distinct Characters Equal | Hash TableStringCounting | Medium |
| 2536 | Increment Submatrices by One | ArrayMatrixPrefix Sum | Medium |
| 2537 | Count the Number of Good Subarrays | ArrayHash TableSliding Window | Medium |
| 2541 | Minimum Operations to Make Array Equal II | ArrayMathGreedy | Medium |
| 2542 | Maximum Subsequence Score | ArrayGreedySorting+1 | Medium |
| 2545 | Sort the Students by Their Kth Score | ArraySortingMatrix | Medium |
| 2546 | Apply Bitwise Operations to Make Strings Equal | StringBit Manipulation | Medium |
| 2550 | Count Collisions of Monkeys on a Polygon | MathRecursion | Medium |
| 2554 | Maximum Number of Integers to Choose From a Range I | ArrayHash TableBinary Search+2 | Medium |
| 2555 | Maximize Win From Two Segments | ArrayBinary SearchSliding Window | Medium |
| 2556 | Disconnect Path in a Binary Matrix by at Most One Flip | ArrayDynamic ProgrammingDepth-First Search+2 | Medium |
| 2559 | Count Vowel Strings in Ranges | ArrayStringPrefix Sum | Medium |
| 2560 | House Robber IV | ArrayBinary SearchDynamic Programming+1 | Medium |
| 2563 | Count the Number of Fair Pairs | ArrayTwo PointersBinary Search+1 | Medium |
| 2564 | Substring XOR Queries | ArrayHash TableString+1 | Medium |
| 2567 | Minimum Score by Changing Two Elements | ArrayGreedySorting | Medium |
| 2568 | Minimum Impossible OR | ArrayBit ManipulationBrainteaser | Medium |
| 2571 | Minimum Operations to Reduce an Integer to 0 | Dynamic ProgrammingGreedyBit Manipulation | Medium |
| 2572 | Count the Number of Square-Free Subsets | ArrayMathDynamic Programming+2 | Medium |
| 2575 | Find the Divisibility Array of a String | ArrayMathString | Medium |
| 2576 | Find the Maximum Number of Marked Indices | ArrayTwo PointersBinary Search+2 | Medium |
| 2579 | Count Total Number of Colored Cells | Math | Medium |
| 2580 | Count Ways to Group Overlapping Ranges | ArraySorting | Medium |
| 2583 | Kth Largest Sum in a Binary Tree | TreeBreadth-First SearchSorting+1 | Medium |
| 2587 | Rearrange Array to Maximize Prefix Score | ArrayGreedySorting+1 | Medium |
| 2588 | Count the Number of Beautiful Subarrays | ArrayHash TableBit Manipulation+1 | Medium |
| 2592 | Maximize Greatness of an Array | ArrayTwo PointersGreedy+1 | Medium |
| 2593 | Find Score of an Array After Marking All Elements | ArrayHash TableSorting+2 | Medium |
| 2594 | Minimum Time to Repair Cars | ArrayBinary Search | Medium |
| 2596 | Check Knight Tour Configuration | ArrayDepth-First SearchBreadth-First Search+2 | Medium |
| 2597 | The Number of Beautiful Subsets | ArrayHash TableMath+4 | Medium |
| 2598 | Smallest Missing Non-negative Integer After Operations | ArrayHash TableMath+1 | Medium |
| 2601 | Prime Subtraction Operation | ArrayMathBinary Search+2 | Medium |
| 2602 | Minimum Operations to Make All Array Elements Equal | ArrayBinary SearchSorting+1 | Medium |
| 2606 | Find the Substring With Maximum Cost | ArrayHash TableString+1 | Medium |
| 2607 | Make K-Subarray Sums Equal | ArrayMathGreedy+2 | Medium |
| 2610 | Convert an Array Into a 2D Array With Conditions | ArrayHash Table | Medium |
| 2611 | Mice and Cheese | ArrayGreedySorting+1 | Medium |
| 2615 | Sum of Distances | ArrayHash TablePrefix Sum | Medium |
| 2616 | Minimize the Maximum Difference of Pairs | ArrayBinary SearchDynamic Programming+2 | 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 |
| 2637 | Promise Time Limit | | Medium |
| 2640 | Find the Score of All Prefixes of an Array | ArrayPrefix Sum | Medium |
| 2641 | Cousins in Binary Tree II | Hash TableTreeDepth-First Search+2 | Medium |