2,913 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 3513 | Number of Unique XOR Triplets I | Medium |
| 3514 | Number of Unique XOR Triplets II | Medium |
| 3515 | Shortest Path in a Weighted Tree |
Page 57 of 59
| Hard |
| 3516 | Find Closest Person | Easy |
| 3517 | Smallest Palindromic Rearrangement I | Medium |
| 3518 | Smallest Palindromic Rearrangement II | Hard |
| 3519 | Count Numbers with Non-Decreasing Digits | Hard |
| 3521 | Find Product Recommendation Pairs | Medium |
| 3522 | Calculate Score After Performing Instructions | Medium |
| 3523 | Make Array Non-decreasing | Medium |
| 3524 | Find X Value of Array I | Medium |
| 3525 | Find X Value of Array II | Hard |
| 3527 | Find the Most Common Response | Medium |
| 3528 | Unit Conversion I | Medium |
| 3529 | Count Cells in Overlapping Horizontal and Vertical Substrings | Medium |
| 3530 | Maximum Profit from Valid Topological Order in DAG | Hard |
| 3531 | Count Covered Buildings | Medium |
| 3532 | Path Existence Queries in a Graph I | Medium |
| 3533 | Concatenated Divisibility | Hard |
| 3534 | Path Existence Queries in a Graph II | Hard |
| 3536 | Maximum Product of Two Digits | Easy |
| 3537 | Fill a Special Grid | Medium |
| 3538 | Merge Operations for Minimum Travel Time | Hard |
| 3539 | Find Sum of Array Product of Magical Sequences | Hard |
| 3541 | Find Most Frequent Vowel and Consonant | Easy |
| 3542 | Minimum Operations to Convert All Elements to Zero | Medium |
| 3543 | Maximum Weighted K-Edge Path | Medium |
| 3544 | Subtree Inversion Sum | Hard |
| 3545 | Minimum Deletions for At Most K Distinct Characters | Easy |
| 3546 | Equal Sum Grid Partition I | Medium |
| 3547 | Maximum Sum of Edge Values in a Graph | Hard |
| 3548 | Equal Sum Grid Partition II | Hard |
| 3550 | Smallest Index With Digit Sum Equal to Index | Easy |
| 3551 | Minimum Swaps to Sort by Digit Sum | Medium |
| 3552 | Grid Teleportation Traversal | Medium |
| 3553 | Minimum Weighted Subgraph With the Required Paths II | Hard |
| 3554 | Find Category Recommendation Pairs | Hard |
| 3556 | Sum of Largest Prime Substrings | Medium |
| 3557 | Find Maximum Number of Non Intersecting Substrings | Medium |
| 3558 | Number of Ways to Assign Edge Weights I | Medium |
| 3559 | Number of Ways to Assign Edge Weights II | Hard |
| 3560 | Find Minimum Log Transportation Cost | Easy |
| 3561 | Resulting String After Adjacent Removals | Medium |
| 3562 | Maximum Profit from Trading Stocks with Discounts | Hard |
| 3563 | Lexicographically Smallest String After Adjacent Removals | Hard |
| 3564 | Seasonal Sales Analysis | Medium |
| 3566 | Partition Array into Two Equal Product Subsets | Medium |
| 3567 | Minimum Absolute Difference in Sliding Submatrix | Medium |
| 3568 | Minimum Moves to Clean the Classroom | Medium |
| 3569 | Maximize Count of Distinct Primes After Split | Hard |
© 2026 PhantomCodeAI. All rights reserved.