| 2645 | Minimum Additions to Make Valid String | StringDynamic ProgrammingStack+1 | Medium |
| 2649 | Nested Array Generator | | Medium |
| 2653 | Sliding Subarray Beauty | ArrayHash TableSliding Window | Medium |
| 2654 | Minimum Number of Operations to Make All Array Elements Equal to 1 | ArrayMathNumber Theory | Medium |
| 2657 | Find the Prefix Common Array of Two Arrays | ArrayHash TableBit Manipulation | Medium |
| 2658 | Maximum Number of Fish in a Grid | ArrayDepth-First SearchBreadth-First Search+2 | Medium |
| 2661 | First Completely Painted Row or Column | ArrayHash TableMatrix | Medium |
| 2662 | Minimum Cost of a Path With Special Roads | ArrayGraphHeap (Priority Queue)+1 | Medium |
| 2671 | Frequency Tracker | Hash TableDesign | Medium |
| 2672 | Number of Adjacent Elements With the Same Color | Array | Medium |
| 2673 | Make Costs of Paths Equal in a Binary Tree | ArrayDynamic ProgrammingGreedy+2 | Medium |
| 2679 | Sum in a Matrix | ArraySortingHeap (Priority Queue)+2 | Medium |
| 2680 | Maximum OR | ArrayGreedyBit Manipulation+1 | Medium |
| 2683 | Neighboring Bitwise XOR | ArrayBit Manipulation | Medium |
| 2684 | Maximum Number of Moves in a Grid | ArrayDynamic ProgrammingMatrix | Medium |
| 2685 | Count the Number of Complete Components | Depth-First SearchBreadth-First SearchUnion Find+1 | Medium |
| 2693 | Call Function with Custom Context | | Medium |
| 2694 | Event Emitter | | Medium |
| 2698 | Find the Punishment Number of an Integer | MathBacktracking | Medium |
| 2705 | Compact Object | | Medium |
| 2707 | Extra Characters in a String | ArrayHash TableString+2 | Medium |
| 2708 | Maximum Strength of a Group | ArrayDynamic ProgrammingBacktracking+4 | Medium |
| 2711 | Difference of Number of Distinct Values on Diagonals | ArrayHash TableMatrix | Medium |
| 2712 | Minimum Cost to Make All Characters Equal | StringDynamic ProgrammingGreedy | Medium |
| 2718 | Sum of Matrix After Queries | ArrayHash Table | Medium |
| 2721 | Execute Asynchronous Functions in Parallel | | Medium |
| 2722 | Join Two Arrays by ID | | Medium |
| 2730 | Find the Longest Semi-Repetitive Substring | StringSliding Window | Medium |
| 2731 | Movement of Robots | ArrayBrainteaserSorting+1 | Medium |
| 2734 | Lexicographically Smallest String After Substring Operation | StringGreedy | Medium |
| 2735 | Collecting Chocolates | ArrayEnumeration | Medium |
| 2740 | Find the Value of the Partition | ArraySorting | Medium |
| 2741 | Special Permutations | ArrayDynamic ProgrammingBit Manipulation+1 | Medium |
| 2745 | Construct the Longest New String | MathDynamic ProgrammingGreedy+1 | Medium |
| 2746 | Decremental String Concatenation | ArrayStringDynamic Programming | Medium |
| 2747 | Count Zero Request Servers | ArrayHash TableSliding Window+1 | Medium |
| 2749 | Minimum Operations to Make the Integer Zero | Bit ManipulationBrainteaserEnumeration | Medium |
| 2750 | Ways to Split Array Into Good Subarrays | ArrayMathDynamic Programming | Medium |
| 2761 | Prime Pairs With Target Sum | ArrayMathEnumeration+1 | Medium |
| 2762 | Continuous Subarrays | ArrayQueueSliding Window+3 | Medium |
| 2766 | Relocate Marbles | ArrayHash TableSorting+1 | Medium |
| 2767 | Partition String Into Minimum Beautiful Substrings | Hash TableStringDynamic Programming+1 | Medium |
| 2768 | Number of Black Blocks | ArrayHash TableEnumeration | Medium |
| 2770 | Maximum Number of Jumps to Reach the Last Index | ArrayDynamic Programming | Medium |
| 2771 | Longest Non-decreasing Subarray From Two Arrays | ArrayDynamic Programming | Medium |
| 2772 | Apply Operations to Make All Array Elements Equal to Zero | ArrayPrefix Sum | Medium |
| 2779 | Maximum Beauty of an Array After Applying Operation | ArrayBinary SearchSliding Window+1 | Medium |
| 2780 | Minimum Index of a Valid Split | ArrayHash TableSorting | Medium |
| 2785 | Sort Vowels in a String | StringSorting | Medium |
| 2786 | Visit Array Positions to Maximize Score | ArrayDynamic Programming | Medium |