1,464 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 2531 | Make Number of Distinct Characters Equal | Medium |
| 2536 | Increment Submatrices by One | Medium |
| 2537 | Count the Number of Good Subarrays |
Page 22 of 30
| Medium |
| 2541 | Minimum Operations to Make Array Equal II | Medium |
| 2542 | Maximum Subsequence Score | Medium |
| 2545 | Sort the Students by Their Kth Score | Medium |
| 2546 | Apply Bitwise Operations to Make Strings Equal | Medium |
| 2550 | Count Collisions of Monkeys on a Polygon | Medium |
| 2554 | Maximum Number of Integers to Choose From a Range I | Medium |
| 2555 | Maximize Win From Two Segments | Medium |
| 2556 | Disconnect Path in a Binary Matrix by at Most One Flip | Medium |
| 2559 | Count Vowel Strings in Ranges | Medium |
| 2560 | House Robber IV | Medium |
| 2563 | Count the Number of Fair Pairs | Medium |
| 2564 | Substring XOR Queries | Medium |
| 2567 | Minimum Score by Changing Two Elements | Medium |
| 2568 | Minimum Impossible OR | Medium |
| 2571 | Minimum Operations to Reduce an Integer to 0 | Medium |
| 2572 | Count the Number of Square-Free Subsets | Medium |
| 2575 | Find the Divisibility Array of a String | Medium |
| 2576 | Find the Maximum Number of Marked Indices | Medium |
| 2579 | Count Total Number of Colored Cells | Medium |
| 2580 | Count Ways to Group Overlapping Ranges | Medium |
| 2583 | Kth Largest Sum in a Binary Tree | Medium |
| 2587 | Rearrange Array to Maximize Prefix Score | Medium |
| 2588 | Count the Number of Beautiful Subarrays | Medium |
| 2592 | Maximize Greatness of an Array | Medium |
| 2593 | Find Score of an Array After Marking All Elements | Medium |
| 2594 | Minimum Time to Repair Cars | Medium |
| 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 |
| 2637 | Promise Time Limit | Medium |
| 2640 | Find the Score of All Prefixes of an Array | Medium |
| 2641 | Cousins in Binary Tree II | Medium |
© 2026 PhantomCodeAI. All rights reserved.