686 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 2532 | Time to Cross a Bridge | Hard |
| 2538 | Difference Between Maximum and Minimum Price Sum | Hard |
| 2543 | Check if Point Is Reachable |
Page 10 of 14
| Hard |
| 2547 | Minimum Cost to Split an Array | Hard |
| 2551 | Put Marbles in Bags | Hard |
| 2552 | Count Increasing Quadruplets | Hard |
| 2561 | Rearranging Fruits | Hard |
| 2565 | Subsequence With the Minimum Score | Hard |
| 2569 | Handling Sum Queries After Update | Hard |
| 2573 | Find the String with LCP | Hard |
| 2577 | Minimum Time to Visit a Cell In a Grid | Hard |
| 2581 | Count Number of Possible Root Nodes | Hard |
| 2584 | Split the Array to Make Coprime Products | Hard |
| 2585 | Number of Ways to Earn Points | Hard |
| 2589 | Minimum Time to Complete All Tasks | Hard |
| 2603 | Collect Coins in a Tree | Hard |
| 2608 | Shortest Cycle in a Graph | Hard |
| 2612 | Minimum Reverse Operations | Hard |
| 2617 | Minimum Number of Visited Cells in a Grid | Hard |
| 2630 | Memoize II | Hard |
| 2642 | Design Graph With Shortest Path Calculator | Hard |
| 2646 | Minimize the Total Price of the Trips | Hard |
| 2650 | Design Cancellable Function | Hard |
| 2659 | Make Array Empty | Hard |
| 2663 | Lexicographically Smallest Beautiful String | Hard |
| 2681 | Power of Heroes | Hard |
| 2699 | Modify Graph Edge Weights | Hard |
| 2709 | Greatest Common Divisor Traversal | Hard |
| 2713 | Maximum Strictly Increasing Cells in a Matrix | Hard |
| 2719 | Count of Integers | Hard |
| 2732 | Find a Good Subset of the Matrix | Hard |
| 2736 | Maximum Sum Queries | Hard |
| 2742 | Painting the Walls | Hard |
| 2751 | Robot Collisions | Hard |
| 2763 | Sum of Imbalance Numbers of All Subarrays | Hard |
| 2781 | Length of the Longest Valid Substring | Hard |
| 2790 | Maximum Number of Groups With Increasing Length | Hard |
| 2791 | Count Paths That Can Form a Palindrome in a Tree | Hard |
| 2801 | Count Stepping Numbers in Range | Hard |
| 2809 | Minimum Time to Make Array Sum At Most x | Hard |
| 2813 | Maximum Elegance of a K-Length Subsequence | Hard |
| 2818 | Apply Operations to Maximize Score | Hard |
| 2827 | Number of Beautiful Integers in the Range | Hard |
| 2835 | Minimum Operations to Form Subsequence With Target Sum | Hard |
| 2836 | Maximize Value of Function in a Ball Passing Game | Hard |
| 2842 | Count K-Subsequences of a String With Maximum Beauty | Hard |
| 2846 | Minimum Edge Weight Equilibrium Queries in a Tree | Hard |
| 2851 | String Transformation | Hard |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | Hard |
| 2862 | Maximum Element-Sum of a Complete Subset of Indices | Hard |
© 2026 PhantomCodeAI. All rights reserved.