2,913 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 3570 | Find Books with No Available Copies | Easy |
| 3572 | Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values | Medium |
| 3573 | Best Time to Buy and Sell Stock V |
Page 58 of 59
| Medium |
| 3574 | Maximize Subarray GCD Score | Hard |
| 3575 | Maximum Good Subtree Score | Hard |
| 3576 | Transform Array to All Equal Elements | Medium |
| 3577 | Count the Number of Computer Unlocking Permutations | Medium |
| 3578 | Count Partitions With Max-Min Difference at Most K | Medium |
| 3579 | Minimum Steps to Convert String with Operations | Hard |
| 3580 | Find Consistently Improving Employees | Medium |
| 3582 | Generate Tag for Video Caption | Easy |
| 3583 | Count Special Triplets | Medium |
| 3584 | Maximum Product of First and Last Elements of a Subsequence | Medium |
| 3585 | Find Weighted Median Node in Tree | Hard |
| 3586 | Find COVID Recovery Patients | Medium |
| 3587 | Minimum Adjacent Swaps to Alternate Parity | Medium |
| 3588 | Find Maximum Area of a Triangle | Medium |
| 3589 | Count Prime-Gap Balanced Subarrays | Medium |
| 3590 | Kth Smallest Path XOR Sum | Hard |
| 3591 | Check if Any Element Has Prime Frequency | Easy |
| 3592 | Inverse Coin Change | Medium |
| 3593 | Minimum Increments to Equalize Leaf Paths | Medium |
| 3594 | Minimum Time to Transport All Individuals | Hard |
| 3597 | Partition String | Medium |
| 3598 | Longest Common Prefix Between Adjacent Strings After Removals | Medium |
| 3599 | Partition Array to Minimize XOR | Medium |
| 3600 | Maximize Spanning Tree Stability with Upgrades | Hard |
| 3601 | Find Drivers with Improved Fuel Efficiency | Medium |
| 3602 | Hexadecimal and Hexatrigesimal Conversion | Easy |
| 3603 | Minimum Cost Path with Alternating Directions II | Medium |
| 3604 | Minimum Time to Reach Destination in Directed Graph | Medium |
| 3605 | Minimum Stability Factor of Array | Hard |
| 3606 | Coupon Code Validator | Easy |
| 3607 | Power Grid Maintenance | Medium |
| 3608 | Minimum Time for K Connected Components | Medium |
| 3609 | Minimum Moves to Reach Target in Grid | Hard |
| 3611 | Find Overbooked Employees | Medium |
| 3612 | Process String with Special Operations I | Medium |
| 3613 | Minimize Maximum Component Cost | Medium |
| 3614 | Process String with Special Operations II | Hard |
| 3615 | Longest Palindromic Path in Graph | Hard |
| 3617 | Find Students with Study Spiral Pattern | Hard |
| 3618 | Split Array by Prime Indices | Medium |
| 3619 | Count Islands With Total Value Divisible by K | Medium |
| 3620 | Network Recovery Pathways | Hard |
| 3621 | Number of Integers With Popcount-Depth Equal to K I | Hard |
| 3622 | Check Divisibility by Digit Sum and Product | Easy |
| 3623 | Count Number of Trapezoids I | Medium |
| 3624 | Number of Integers With Popcount-Depth Equal to K II | Hard |
| 3625 | Count Number of Trapezoids II | Hard |
© 2026 PhantomCodeAI. All rights reserved.