| 3503 | Longest Palindrome After Substring Concatenation I | Two PointersStringDynamic Programming+1 | Medium |
| 3508 | Implement Router | ArrayHash TableBinary Search+3 | Medium |
| 3513 | Number of Unique XOR Triplets I | ArrayMathBit Manipulation | Medium |
| 3514 | Number of Unique XOR Triplets II | ArrayMathBit Manipulation+1 | Medium |
| 3517 | Smallest Palindromic Rearrangement I | StringSortingCounting Sort | Medium |
| 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 |
| 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 |
| 3531 | Count Covered Buildings | ArrayHash TableSorting | Medium |
| 3532 | Path Existence Queries in a Graph I | ArrayHash TableBinary Search+2 | Medium |
| 3537 | Fill a Special Grid | ArrayDivide and ConquerMatrix | Medium |
| 3542 | Minimum Operations to Convert All Elements to Zero | ArrayHash TableStack+2 | Medium |
| 3543 | Maximum Weighted K-Edge Path | Hash TableDynamic ProgrammingGraph | Medium |
| 3546 | Equal Sum Grid Partition I | ArrayMatrixEnumeration+1 | Medium |
| 3551 | Minimum Swaps to Sort by Digit Sum | ArrayHash TableSorting | Medium |
| 3552 | Grid Teleportation Traversal | ArrayHash TableBreadth-First Search+1 | Medium |
| 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 |
| 3561 | Resulting String After Adjacent Removals | StringStackSimulation | Medium |
| 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 |
| 3572 | Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values | ArrayHash TableGreedy+2 | Medium |
| 3573 | Best Time to Buy and Sell Stock V | ArrayDynamic Programming | Medium |
| 3576 | Transform Array to All Equal Elements | ArrayGreedy | Medium |
| 3577 | Count the Number of Computer Unlocking Permutations | ArrayMathBrainteaser+1 | Medium |
| 3578 | Count Partitions With Max-Min Difference at Most K | ArrayDynamic ProgrammingQueue+3 | Medium |
| 3580 | Find Consistently Improving Employees | Database | Medium |
| 3583 | Count Special Triplets | ArrayHash TableCounting | Medium |
| 3584 | Maximum Product of First and Last Elements of a Subsequence | ArrayTwo Pointers | Medium |
| 3586 | Find COVID Recovery Patients | Database | Medium |
| 3587 | Minimum Adjacent Swaps to Alternate Parity | ArrayGreedy | Medium |
| 3588 | Find Maximum Area of a Triangle | ArrayHash TableMath+3 | Medium |
| 3589 | Count Prime-Gap Balanced Subarrays | ArrayMathQueue+3 | Medium |
| 3592 | Inverse Coin Change | ArrayDynamic Programming | Medium |
| 3593 | Minimum Increments to Equalize Leaf Paths | ArrayDynamic ProgrammingTree+1 | Medium |
| 3597 | Partition String | Hash TableStringTrie+1 | Medium |
| 3598 | Longest Common Prefix Between Adjacent Strings After Removals | ArrayString | Medium |
| 3599 | Partition Array to Minimize XOR | ArrayDynamic ProgrammingBit Manipulation+1 | Medium |
| 3601 | Find Drivers with Improved Fuel Efficiency | Database | Medium |
| 3603 | Minimum Cost Path with Alternating Directions II | ArrayDynamic ProgrammingMatrix | Medium |
| 3604 | Minimum Time to Reach Destination in Directed Graph | GraphHeap (Priority Queue)Shortest Path | Medium |
| 3607 | Power Grid Maintenance | ArrayHash TableDepth-First Search+5 | Medium |
| 3608 | Minimum Time for K Connected Components | Binary SearchUnion FindGraph+1 | Medium |