| 3365 | Rearrange K Substrings to Form Target String | Hash TableStringSorting | Medium |
| 3366 | Minimum Array Sum | ArrayDynamic Programming | Medium |
| 3371 | Identify the Largest Outlier in an Array | ArrayHash TableCounting+1 | Medium |
| 3372 | Maximize the Number of Target Nodes After Connecting Trees I | TreeDepth-First SearchBreadth-First Search | Medium |
| 3376 | Minimum Time to Break Locks I | ArrayDynamic ProgrammingBacktracking+3 | Medium |
| 3377 | Digit Operations to Make Two Integers Equal | MathGraphHeap (Priority Queue)+2 | Medium |
| 3380 | Maximum Area Rectangle With Point Constraints I | ArrayMathBinary Indexed Tree+4 | Medium |
| 3381 | Maximum Subarray Sum With Length Divisible by K | ArrayHash TablePrefix Sum | Medium |
| 3387 | Maximize Amount After Two Days of Conversions | ArrayStringDepth-First Search+2 | Medium |
| 3388 | Count Beautiful Splits in an Array | ArrayDynamic Programming | Medium |
| 3393 | Count Paths With the Given XOR Value | ArrayDynamic ProgrammingBit Manipulation+1 | Medium |
| 3394 | Check if Grid can be Cut into Sections | ArraySorting | Medium |
| 3397 | Maximum Number of Distinct Elements After Operations | ArrayGreedySorting | Medium |
| 3403 | Find the Lexicographically Largest String From the Box I | Two PointersStringEnumeration | Medium |
| 3404 | Count Special Subsequences | ArrayHash TableMath+1 | Medium |
| 3408 | Design Task Manager | Hash TableDesignHeap (Priority Queue)+1 | Medium |
| 3409 | Longest Subsequence With Decreasing Adjacent Difference | ArrayDynamic Programming | Medium |
| 3412 | Find Mirror Score of a String | Hash TableStringStack+1 | Medium |
| 3413 | Maximum Coins From K Consecutive Bags | ArrayBinary SearchGreedy+3 | Medium |
| 3418 | Maximum Amount of Money Robot Can Earn | ArrayDynamic ProgrammingMatrix | Medium |
| 3419 | Minimize the Maximum Edge Weight of Graph | Binary SearchDepth-First SearchBreadth-First Search+2 | Medium |
| 3421 | Find Students Who Improved | Database | Medium |
| 3424 | Minimum Cost to Make Arrays Identical | ArrayGreedySorting | Medium |
| 3428 | Maximum and Minimum Sums of at Most Size K Subsequences | ArrayMathDynamic Programming+2 | Medium |
| 3429 | Paint House IV | ArrayDynamic Programming | Medium |
| 3433 | Count Mentions Per User | ArrayMathSorting+1 | Medium |
| 3434 | Maximum Frequency After Subarray Operation | ArrayHash TableDynamic Programming+3 | Medium |
| 3439 | Reschedule Meetings for Maximum Free Time I | ArrayGreedySliding Window | Medium |
| 3440 | Reschedule Meetings for Maximum Free Time II | ArrayGreedyEnumeration | Medium |
| 3443 | Maximum Manhattan Distance After K Changes | Hash TableMathString+1 | Medium |
| 3446 | Sort Matrix by Diagonals | ArraySortingMatrix | Medium |
| 3447 | Assign Elements to Groups with Constraints | ArrayHash Table | Medium |
| 3453 | Separate Squares I | ArrayBinary Search | Medium |
| 3457 | Eat Pizzas! | ArrayGreedySorting | Medium |
| 3458 | Select K Disjoint Special Substrings | Hash TableStringDynamic Programming+2 | Medium |
| 3462 | Maximum Sum With at Most K Elements | ArrayGreedySorting+2 | Medium |
| 3468 | Find the Number of Copy Arrays | ArrayMath | Medium |
| 3469 | Find Minimum Cost to Remove Array Elements | ArrayDynamic Programming | Medium |
| 3472 | Longest Palindromic Subsequence After at Most K Operations | StringDynamic Programming | Medium |
| 3473 | Sum of K Subarrays With Length at Least M | ArrayDynamic ProgrammingPrefix Sum | Medium |
| 3475 | DNA Pattern Recognition | Database | Medium |
| 3478 | Choose K Elements With Maximum Sum | ArraySortingHeap (Priority Queue) | Medium |
| 3479 | Fruits Into Baskets III | ArrayBinary SearchSegment Tree+1 | Medium |
| 3484 | Design Spreadsheet | ArrayHash TableString+2 | Medium |
| 3488 | Closest Equal Element Queries | ArrayHash TableBinary Search | Medium |
| 3489 | Zero Array Transformation IV | ArrayDynamic Programming | Medium |
| 3493 | Properties Graph | ArrayHash TableDepth-First Search+3 | Medium |
| 3494 | Find the Minimum Amount of Time to Brew Potions | ArraySimulationPrefix Sum | Medium |
| 3497 | Analyze Subscription Conversion | Database | Medium |
| 3499 | Maximize Active Section with Trade I | StringEnumeration | Medium |