| 3518 | Smallest Palindromic Rearrangement II | Hash TableMathString+2 | Hard |
| 3519 | Count Numbers with Non-Decreasing Digits | MathStringDynamic Programming | Hard |
| 3525 | Find X Value of Array II | ArrayMathSegment Tree | Hard |
| 3530 | Maximum Profit from Valid Topological Order in DAG | ArrayDynamic ProgrammingBit Manipulation+3 | Hard |
| 3533 | Concatenated Divisibility | ArrayDynamic ProgrammingBit Manipulation+1 | Hard |
| 3534 | Path Existence Queries in a Graph II | ArrayBinary SearchGreedy+2 | Hard |
| 3538 | Merge Operations for Minimum Travel Time | ArrayDynamic ProgrammingPrefix Sum | Hard |
| 3539 | Find Sum of Array Product of Magical Sequences | ArrayMathDynamic Programming+3 | Hard |
| 3544 | Subtree Inversion Sum | ArrayDynamic ProgrammingTree+1 | Hard |
| 3547 | Maximum Sum of Edge Values in a Graph | GreedyDepth-First SearchGraph+1 | Hard |
| 3548 | Equal Sum Grid Partition II | ArrayHash TableMatrix+2 | Hard |
| 3553 | Minimum Weighted Subgraph With the Required Paths II | ArrayTreeDepth-First Search | Hard |
| 3554 | Find Category Recommendation Pairs | Database | Hard |
| 3559 | Number of Ways to Assign Edge Weights II | ArrayMathDynamic Programming+2 | Hard |
| 3562 | Maximum Profit from Trading Stocks with Discounts | ArrayDynamic ProgrammingTree+1 | Hard |
| 3563 | Lexicographically Smallest String After Adjacent Removals | StringDynamic Programming | Hard |
| 3569 | Maximize Count of Distinct Primes After Split | ArrayMathSegment Tree+1 | Hard |
| 3574 | Maximize Subarray GCD Score | ArrayMathEnumeration+1 | Hard |
| 3575 | Maximum Good Subtree Score | ArrayDynamic ProgrammingBit Manipulation+3 | Hard |
| 3579 | Minimum Steps to Convert String with Operations | StringDynamic ProgrammingGreedy | Hard |
| 3585 | Find Weighted Median Node in Tree | ArrayBinary SearchDynamic Programming+2 | Hard |
| 3590 | Kth Smallest Path XOR Sum | ArrayTreeDepth-First Search+1 | Hard |
| 3594 | Minimum Time to Transport All Individuals | ArrayDynamic ProgrammingBit Manipulation+4 | Hard |
| 3600 | Maximize Spanning Tree Stability with Upgrades | Binary SearchGreedyUnion Find+2 | Hard |
| 3605 | Minimum Stability Factor of Array | ArrayMathBinary Search+3 | Hard |
| 3609 | Minimum Moves to Reach Target in Grid | Math | Hard |
| 3614 | Process String with Special Operations II | StringSimulation | Hard |
| 3615 | Longest Palindromic Path in Graph | StringDynamic ProgrammingBit Manipulation+2 | Hard |
| 3617 | Find Students with Study Spiral Pattern | | Hard |
| 3620 | Network Recovery Pathways | ArrayBinary SearchDynamic Programming+4 | Hard |
| 3621 | Number of Integers With Popcount-Depth Equal to K I | MathDynamic ProgrammingCombinatorics | Hard |
| 3624 | Number of Integers With Popcount-Depth Equal to K II | ArraySegment Tree | Hard |
| 3625 | Count Number of Trapezoids II | ArrayHash TableMath+1 | Hard |
| 3630 | Partition Array for Maximum XOR and AND | ArrayMathGreedy+1 | Hard |
| 3636 | Threshold Majority Queries | | Hard |
| 3640 | Trionic Array II | | Hard |