| 2602 | Minimum Operations to Make All Array Elements Equal | ArrayBinary SearchSorting+1 | Medium |
| 2603 | Collect Coins in a Tree | ArrayTreeGraph+1 | Hard |
| 2605 | Form Smallest Number From Two Digit Arrays | ArrayHash TableEnumeration | Easy |
| 2606 | Find the Substring With Maximum Cost | ArrayHash TableString+1 | Medium |
| 2607 | Make K-Subarray Sums Equal | ArrayMathGreedy+2 | Medium |
| 2608 | Shortest Cycle in a Graph | Breadth-First SearchGraph | Hard |
| 2609 | Find the Longest Balanced Substring of a Binary String | String | Easy |
| 2610 | Convert an Array Into a 2D Array With Conditions | ArrayHash Table | Medium |
| 2611 | Mice and Cheese | ArrayGreedySorting+1 | Medium |
| 2612 | Minimum Reverse Operations | ArrayBreadth-First SearchOrdered Set | Hard |
| 2614 | Prime In Diagonal | ArrayMathMatrix+1 | Easy |
| 2615 | Sum of Distances | ArrayHash TablePrefix Sum | Medium |
| 2616 | Minimize the Maximum Difference of Pairs | ArrayBinary SearchDynamic Programming+2 | Medium |
| 2617 | Minimum Number of Visited Cells in a Grid | ArrayDynamic ProgrammingStack+5 | Hard |
| 2618 | Check if Object Instance of Class | | Medium |
| 2619 | Array Prototype Last | | Easy |
| 2620 | Counter | | Easy |
| 2621 | Sleep | | Easy |
| 2622 | Cache With Time Limit | | Medium |
| 2623 | Memoize | | Medium |
| 2624 | Snail Traversal | | Medium |
| 2625 | Flatten Deeply Nested Array | | Medium |
| 2626 | Array Reduce Transformation | | Easy |
| 2627 | Debounce | | Medium |
| 2629 | Function Composition | | Easy |
| 2630 | Memoize II | | Hard |
| 2631 | Group By | | Medium |
| 2634 | Filter Elements from Array | | Easy |
| 2635 | Apply Transform Over Each Element in Array | | Easy |
| 2637 | Promise Time Limit | | Medium |
| 2639 | Find the Width of Columns of a Grid | ArrayMatrix | Easy |
| 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 |
| 2642 | Design Graph With Shortest Path Calculator | GraphDesignHeap (Priority Queue)+1 | Hard |
| 2643 | Row With Maximum Ones | ArrayMatrix | Easy |
| 2644 | Find the Maximum Divisibility Score | Array | Easy |
| 2645 | Minimum Additions to Make Valid String | StringDynamic ProgrammingStack+1 | Medium |
| 2646 | Minimize the Total Price of the Trips | ArrayDynamic ProgrammingTree+2 | Hard |
| 2648 | Generate Fibonacci Sequence | | Easy |
| 2649 | Nested Array Generator | | Medium |
| 2650 | Design Cancellable Function | | Hard |
| 2651 | Calculate Delayed Arrival Time | Math | Easy |
| 2652 | Sum Multiples | Math | Easy |
| 2653 | Sliding Subarray Beauty | ArrayHash TableSliding Window | Medium |
| 2654 | Minimum Number of Operations to Make All Array Elements Equal to 1 | ArrayMathNumber Theory | Medium |
| 2656 | Maximum Sum With Exactly K Elements | ArrayGreedy | Easy |
| 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 |
| 2659 | Make Array Empty | ArrayBinary SearchGreedy+4 | Hard |
| 2660 | Determine the Winner of a Bowling Game | ArraySimulation | Easy |