686 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 3518 | Smallest Palindromic Rearrangement II | Hard |
| 3519 | Count Numbers with Non-Decreasing Digits | Hard |
| 3525 | Find X Value of Array II |
Page 14 of 14
| Hard |
| 3530 | Maximum Profit from Valid Topological Order in DAG | Hard |
| 3533 | Concatenated Divisibility | Hard |
| 3534 | Path Existence Queries in a Graph II | Hard |
| 3538 | Merge Operations for Minimum Travel Time | Hard |
| 3539 | Find Sum of Array Product of Magical Sequences | Hard |
| 3544 | Subtree Inversion Sum | Hard |
| 3547 | Maximum Sum of Edge Values in a Graph | Hard |
| 3548 | Equal Sum Grid Partition II | Hard |
| 3553 | Minimum Weighted Subgraph With the Required Paths II | Hard |
| 3554 | Find Category Recommendation Pairs | Hard |
| 3559 | Number of Ways to Assign Edge Weights II | Hard |
| 3562 | Maximum Profit from Trading Stocks with Discounts | Hard |
| 3563 | Lexicographically Smallest String After Adjacent Removals | Hard |
| 3569 | Maximize Count of Distinct Primes After Split | Hard |
| 3574 | Maximize Subarray GCD Score | Hard |
| 3575 | Maximum Good Subtree Score | Hard |
| 3579 | Minimum Steps to Convert String with Operations | Hard |
| 3585 | Find Weighted Median Node in Tree | Hard |
| 3590 | Kth Smallest Path XOR Sum | Hard |
| 3594 | Minimum Time to Transport All Individuals | Hard |
| 3600 | Maximize Spanning Tree Stability with Upgrades | Hard |
| 3605 | Minimum Stability Factor of Array | Hard |
| 3609 | Minimum Moves to Reach Target in Grid | Hard |
| 3614 | Process String with Special Operations II | Hard |
| 3615 | Longest Palindromic Path in Graph | Hard |
| 3617 | Find Students with Study Spiral Pattern | Hard |
| 3620 | Network Recovery Pathways | Hard |
| 3621 | Number of Integers With Popcount-Depth Equal to K I | Hard |
| 3624 | Number of Integers With Popcount-Depth Equal to K II | Hard |
| 3625 | Count Number of Trapezoids II | Hard |
| 3630 | Partition Array for Maximum XOR and AND | Hard |
| 3636 | Threshold Majority Queries | Hard |
| 3640 | Trionic Array II | Hard |
© 2026 PhantomCodeAI. All rights reserved.