1,464 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 3365 | Rearrange K Substrings to Form Target String | Medium |
| 3366 | Minimum Array Sum | Medium |
| 3371 | Identify the Largest Outlier in an Array |
Page 28 of 30
| Medium |
| 3372 | Maximize the Number of Target Nodes After Connecting Trees I | Medium |
| 3376 | Minimum Time to Break Locks I | Medium |
| 3377 | Digit Operations to Make Two Integers Equal | Medium |
| 3380 | Maximum Area Rectangle With Point Constraints I | Medium |
| 3381 | Maximum Subarray Sum With Length Divisible by K | Medium |
| 3387 | Maximize Amount After Two Days of Conversions | Medium |
| 3388 | Count Beautiful Splits in an Array | Medium |
| 3393 | Count Paths With the Given XOR Value | Medium |
| 3394 | Check if Grid can be Cut into Sections | Medium |
| 3397 | Maximum Number of Distinct Elements After Operations | Medium |
| 3403 | Find the Lexicographically Largest String From the Box I | Medium |
| 3404 | Count Special Subsequences | Medium |
| 3408 | Design Task Manager | Medium |
| 3409 | Longest Subsequence With Decreasing Adjacent Difference | Medium |
| 3412 | Find Mirror Score of a String | Medium |
| 3413 | Maximum Coins From K Consecutive Bags | Medium |
| 3418 | Maximum Amount of Money Robot Can Earn | Medium |
| 3419 | Minimize the Maximum Edge Weight of Graph | Medium |
| 3421 | Find Students Who Improved | Medium |
| 3424 | Minimum Cost to Make Arrays Identical | Medium |
| 3428 | Maximum and Minimum Sums of at Most Size K Subsequences | Medium |
| 3429 | Paint House IV | Medium |
| 3433 | Count Mentions Per User | Medium |
| 3434 | Maximum Frequency After Subarray Operation | Medium |
| 3439 | Reschedule Meetings for Maximum Free Time I | Medium |
| 3440 | Reschedule Meetings for Maximum Free Time II | Medium |
| 3443 | Maximum Manhattan Distance After K Changes | Medium |
| 3446 | Sort Matrix by Diagonals | Medium |
| 3447 | Assign Elements to Groups with Constraints | Medium |
| 3453 | Separate Squares I | Medium |
| 3457 | Eat Pizzas! | Medium |
| 3458 | Select K Disjoint Special Substrings | Medium |
| 3462 | Maximum Sum With at Most K Elements | Medium |
| 3468 | Find the Number of Copy Arrays | Medium |
| 3469 | Find Minimum Cost to Remove Array Elements | Medium |
| 3472 | Longest Palindromic Subsequence After at Most K Operations | Medium |
| 3473 | Sum of K Subarrays With Length at Least M | Medium |
| 3475 | DNA Pattern Recognition | Medium |
| 3478 | Choose K Elements With Maximum Sum | Medium |
| 3479 | Fruits Into Baskets III | Medium |
| 3484 | Design Spreadsheet | Medium |
| 3488 | Closest Equal Element Queries | Medium |
| 3489 | Zero Array Transformation IV | Medium |
| 3493 | Properties Graph | Medium |
| 3494 | Find the Minimum Amount of Time to Brew Potions | Medium |
| 3497 | Analyze Subscription Conversion | Medium |
| 3499 | Maximize Active Section with Trade I | Medium |
© 2026 PhantomCodeAI. All rights reserved.