| 2549 | Count Distinct Numbers on Board | ArrayHash TableMath+1 | Easy |
| 2550 | Count Collisions of Monkeys on a Polygon | MathRecursion | Medium |
| 2551 | Put Marbles in Bags | ArrayGreedySorting+1 | Hard |
| 2552 | Count Increasing Quadruplets | ArrayDynamic ProgrammingBinary Indexed Tree+2 | Hard |
| 2553 | Separate the Digits in an Array | ArraySimulation | Easy |
| 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 |
| 2558 | Take Gifts From the Richest Pile | ArrayHeap (Priority Queue)Simulation | Easy |
| 2559 | Count Vowel Strings in Ranges | ArrayStringPrefix Sum | Medium |
| 2560 | House Robber IV | ArrayBinary SearchDynamic Programming+1 | Medium |
| 2561 | Rearranging Fruits | ArrayHash TableGreedy+1 | Hard |
| 2562 | Find the Array Concatenation Value | ArrayTwo PointersSimulation | Easy |
| 2563 | Count the Number of Fair Pairs | ArrayTwo PointersBinary Search+1 | Medium |
| 2564 | Substring XOR Queries | ArrayHash TableString+1 | Medium |
| 2565 | Subsequence With the Minimum Score | Two PointersStringBinary Search | Hard |
| 2566 | Maximum Difference by Remapping a Digit | MathGreedy | Easy |
| 2567 | Minimum Score by Changing Two Elements | ArrayGreedySorting | Medium |
| 2568 | Minimum Impossible OR | ArrayBit ManipulationBrainteaser | Medium |
| 2569 | Handling Sum Queries After Update | ArraySegment Tree | Hard |
| 2570 | Merge Two 2D Arrays by Summing Values | ArrayHash TableTwo Pointers | Easy |
| 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 |
| 2573 | Find the String with LCP | ArrayStringDynamic Programming+3 | Hard |
| 2574 | Left and Right Sum Differences | ArrayPrefix Sum | Easy |
| 2575 | Find the Divisibility Array of a String | ArrayMathString | Medium |
| 2576 | Find the Maximum Number of Marked Indices | ArrayTwo PointersBinary Search+2 | Medium |
| 2577 | Minimum Time to Visit a Cell In a Grid | ArrayBreadth-First SearchGraph+3 | Hard |
| 2578 | Split With Minimum Sum | MathGreedySorting | Easy |
| 2579 | Count Total Number of Colored Cells | Math | Medium |
| 2580 | Count Ways to Group Overlapping Ranges | ArraySorting | Medium |
| 2581 | Count Number of Possible Root Nodes | ArrayHash TableDynamic Programming+2 | Hard |
| 2582 | Pass the Pillow | MathSimulation | Easy |
| 2583 | Kth Largest Sum in a Binary Tree | TreeBreadth-First SearchSorting+1 | Medium |
| 2584 | Split the Array to Make Coprime Products | ArrayHash TableMath+1 | Hard |
| 2585 | Number of Ways to Earn Points | ArrayDynamic Programming | Hard |
| 2586 | Count the Number of Vowel Strings in Range | ArrayStringCounting | Easy |
| 2587 | Rearrange Array to Maximize Prefix Score | ArrayGreedySorting+1 | Medium |
| 2588 | Count the Number of Beautiful Subarrays | ArrayHash TableBit Manipulation+1 | Medium |
| 2589 | Minimum Time to Complete All Tasks | ArrayBinary SearchStack+2 | Hard |
| 2591 | Distribute Money to Maximum Children | MathGreedy | Easy |
| 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 |
| 2595 | Number of Even and Odd Bits | Bit Manipulation | Easy |
| 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 |
| 2600 | K Items With the Maximum Sum | MathGreedy | Easy |
| 2601 | Prime Subtraction Operation | ArrayMathBinary Search+2 | Medium |