| 3513 | Number of Unique XOR Triplets I | ArrayMathBit Manipulation | Medium |
| 3514 | Number of Unique XOR Triplets II | ArrayMathBit Manipulation+1 | Medium |
| 3515 | Shortest Path in a Weighted Tree | ArrayTreeDepth-First Search+2 | Hard |
| 3516 | Find Closest Person | Math | Easy |
| 3517 | Smallest Palindromic Rearrangement I | StringSortingCounting Sort | Medium |
| 3518 | Smallest Palindromic Rearrangement II | Hash TableMathString+2 | Hard |
| 3519 | Count Numbers with Non-Decreasing Digits | MathStringDynamic Programming | Hard |
| 3521 | Find Product Recommendation Pairs | Database | Medium |
| 3522 | Calculate Score After Performing Instructions | ArrayHash TableString+1 | Medium |
| 3523 | Make Array Non-decreasing | ArrayStackGreedy+1 | Medium |
| 3524 | Find X Value of Array I | ArrayMathDynamic Programming | Medium |
| 3525 | Find X Value of Array II | ArrayMathSegment Tree | Hard |
| 3527 | Find the Most Common Response | ArrayHash TableString+1 | Medium |
| 3528 | Unit Conversion I | Depth-First SearchBreadth-First SearchGraph | Medium |
| 3529 | Count Cells in Overlapping Horizontal and Vertical Substrings | ArrayStringRolling Hash+3 | Medium |
| 3530 | Maximum Profit from Valid Topological Order in DAG | ArrayDynamic ProgrammingBit Manipulation+3 | Hard |
| 3531 | Count Covered Buildings | ArrayHash TableSorting | Medium |
| 3532 | Path Existence Queries in a Graph I | ArrayHash TableBinary Search+2 | Medium |
| 3533 | Concatenated Divisibility | ArrayDynamic ProgrammingBit Manipulation+1 | Hard |
| 3534 | Path Existence Queries in a Graph II | ArrayBinary SearchGreedy+2 | Hard |
| 3536 | Maximum Product of Two Digits | MathSorting | Easy |
| 3537 | Fill a Special Grid | ArrayDivide and ConquerMatrix | Medium |
| 3538 | Merge Operations for Minimum Travel Time | ArrayDynamic ProgrammingPrefix Sum | Hard |
| 3539 | Find Sum of Array Product of Magical Sequences | ArrayMathDynamic Programming+3 | Hard |
| 3541 | Find Most Frequent Vowel and Consonant | Hash TableStringCounting | Easy |
| 3542 | Minimum Operations to Convert All Elements to Zero | ArrayHash TableStack+2 | Medium |
| 3543 | Maximum Weighted K-Edge Path | Hash TableDynamic ProgrammingGraph | Medium |
| 3544 | Subtree Inversion Sum | ArrayDynamic ProgrammingTree+1 | Hard |
| 3545 | Minimum Deletions for At Most K Distinct Characters | Hash TableStringGreedy+2 | Easy |
| 3546 | Equal Sum Grid Partition I | ArrayMatrixEnumeration+1 | Medium |
| 3547 | Maximum Sum of Edge Values in a Graph | GreedyDepth-First SearchGraph+1 | Hard |
| 3548 | Equal Sum Grid Partition II | ArrayHash TableMatrix+2 | Hard |
| 3550 | Smallest Index With Digit Sum Equal to Index | ArrayMath | Easy |
| 3551 | Minimum Swaps to Sort by Digit Sum | ArrayHash TableSorting | Medium |
| 3552 | Grid Teleportation Traversal | ArrayHash TableBreadth-First Search+1 | Medium |
| 3553 | Minimum Weighted Subgraph With the Required Paths II | ArrayTreeDepth-First Search | Hard |
| 3554 | Find Category Recommendation Pairs | Database | Hard |
| 3556 | Sum of Largest Prime Substrings | Hash TableMathString+2 | Medium |
| 3557 | Find Maximum Number of Non Intersecting Substrings | Hash TableStringDynamic Programming+1 | Medium |
| 3558 | Number of Ways to Assign Edge Weights I | MathTreeDepth-First Search | Medium |
| 3559 | Number of Ways to Assign Edge Weights II | ArrayMathDynamic Programming+2 | Hard |
| 3560 | Find Minimum Log Transportation Cost | Math | Easy |
| 3561 | Resulting String After Adjacent Removals | StringStackSimulation | Medium |
| 3562 | Maximum Profit from Trading Stocks with Discounts | ArrayDynamic ProgrammingTree+1 | Hard |
| 3563 | Lexicographically Smallest String After Adjacent Removals | StringDynamic Programming | Hard |
| 3564 | Seasonal Sales Analysis | Database | Medium |
| 3566 | Partition Array into Two Equal Product Subsets | ArrayBit ManipulationRecursion+1 | Medium |
| 3567 | Minimum Absolute Difference in Sliding Submatrix | ArraySortingMatrix | Medium |
| 3568 | Minimum Moves to Clean the Classroom | ArrayHash TableBit Manipulation+2 | Medium |
| 3569 | Maximize Count of Distinct Primes After Split | ArrayMathSegment Tree+1 | Hard |