2,913 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 3396 | Minimum Number of Operations to Make Elements in Array Distinct | Easy |
| 3397 | Maximum Number of Distinct Elements After Operations | Medium |
| 3398 | Smallest Substring With Identical Characters I |
Page 55 of 59
| Hard |
| 3399 | Smallest Substring With Identical Characters II | Hard |
| 3402 | Minimum Operations to Make Columns Strictly Increasing | Easy |
| 3403 | Find the Lexicographically Largest String From the Box I | Medium |
| 3404 | Count Special Subsequences | Medium |
| 3405 | Count the Number of Arrays with K Matching Adjacent Elements | Hard |
| 3407 | Substring Matching Pattern | Easy |
| 3408 | Design Task Manager | Medium |
| 3409 | Longest Subsequence With Decreasing Adjacent Difference | Medium |
| 3410 | Maximize Subarray Sum After Removing All Occurrences of One Element | Hard |
| 3411 | Maximum Subarray With Equal Products | Easy |
| 3412 | Find Mirror Score of a String | Medium |
| 3413 | Maximum Coins From K Consecutive Bags | Medium |
| 3414 | Maximum Score of Non-overlapping Intervals | Hard |
| 3417 | Zigzag Grid Traversal With Skip | Easy |
| 3418 | Maximum Amount of Money Robot Can Earn | Medium |
| 3419 | Minimize the Maximum Edge Weight of Graph | Medium |
| 3420 | Count Non-Decreasing Subarrays After K Operations | Hard |
| 3421 | Find Students Who Improved | Medium |
| 3423 | Maximum Difference Between Adjacent Elements in a Circular Array | Easy |
| 3424 | Minimum Cost to Make Arrays Identical | Medium |
| 3425 | Longest Special Path | Hard |
| 3426 | Manhattan Distances of All Arrangements of Pieces | Hard |
| 3427 | Sum of Variable Length Subarrays | Easy |
| 3428 | Maximum and Minimum Sums of at Most Size K Subsequences | Medium |
| 3429 | Paint House IV | Medium |
| 3430 | Maximum and Minimum Sums of at Most Size K Subarrays | Hard |
| 3432 | Count Partitions with Even Sum Difference | Easy |
| 3433 | Count Mentions Per User | Medium |
| 3434 | Maximum Frequency After Subarray Operation | Medium |
| 3435 | Frequencies of Shortest Supersequences | Hard |
| 3436 | Find Valid Emails | Easy |
| 3438 | Find Valid Pair of Adjacent Digits in String | Easy |
| 3439 | Reschedule Meetings for Maximum Free Time I | Medium |
| 3440 | Reschedule Meetings for Maximum Free Time II | Medium |
| 3441 | Minimum Cost Good Caption | Hard |
| 3442 | Maximum Difference Between Even and Odd Frequency I | Easy |
| 3443 | Maximum Manhattan Distance After K Changes | Medium |
| 3444 | Minimum Increments for Target Multiples in an Array | Hard |
| 3445 | Maximum Difference Between Even and Odd Frequency II | Hard |
| 3446 | Sort Matrix by Diagonals | Medium |
| 3447 | Assign Elements to Groups with Constraints | Medium |
| 3448 | Count Substrings Divisible By Last Digit | Hard |
| 3449 | Maximize the Minimum Game Score | Hard |
| 3451 | Find Invalid IP Addresses | Hard |
| 3452 | Sum of Good Numbers | Easy |
| 3453 | Separate Squares I | Medium |
| 3454 | Separate Squares II | Hard |
© 2026 PhantomCodeAI. All rights reserved.