| 3570 | Find Books with No Available Copies | Database | Easy |
| 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 |
| 3574 | Maximize Subarray GCD Score | ArrayMathEnumeration+1 | Hard |
| 3575 | Maximum Good Subtree Score | ArrayDynamic ProgrammingBit Manipulation+3 | Hard |
| 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 |
| 3579 | Minimum Steps to Convert String with Operations | StringDynamic ProgrammingGreedy | Hard |
| 3580 | Find Consistently Improving Employees | Database | Medium |
| 3582 | Generate Tag for Video Caption | StringSimulation | Easy |
| 3583 | Count Special Triplets | ArrayHash TableCounting | Medium |
| 3584 | Maximum Product of First and Last Elements of a Subsequence | ArrayTwo Pointers | Medium |
| 3585 | Find Weighted Median Node in Tree | ArrayBinary SearchDynamic Programming+2 | Hard |
| 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 |
| 3590 | Kth Smallest Path XOR Sum | ArrayTreeDepth-First Search+1 | Hard |
| 3591 | Check if Any Element Has Prime Frequency | ArrayHash TableMath+2 | Easy |
| 3592 | Inverse Coin Change | ArrayDynamic Programming | Medium |
| 3593 | Minimum Increments to Equalize Leaf Paths | ArrayDynamic ProgrammingTree+1 | Medium |
| 3594 | Minimum Time to Transport All Individuals | ArrayDynamic ProgrammingBit Manipulation+4 | Hard |
| 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 |
| 3600 | Maximize Spanning Tree Stability with Upgrades | Binary SearchGreedyUnion Find+2 | Hard |
| 3601 | Find Drivers with Improved Fuel Efficiency | Database | Medium |
| 3602 | Hexadecimal and Hexatrigesimal Conversion | MathString | Easy |
| 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 |
| 3605 | Minimum Stability Factor of Array | ArrayMathBinary Search+3 | Hard |
| 3606 | Coupon Code Validator | ArrayHash TableString+1 | Easy |
| 3607 | Power Grid Maintenance | ArrayHash TableDepth-First Search+5 | Medium |
| 3608 | Minimum Time for K Connected Components | Binary SearchUnion FindGraph+1 | Medium |
| 3609 | Minimum Moves to Reach Target in Grid | Math | Hard |
| 3611 | Find Overbooked Employees | Database | Medium |
| 3612 | Process String with Special Operations I | StringSimulation | Medium |
| 3613 | Minimize Maximum Component Cost | Binary SearchSortUnion Find+1 | Medium |
| 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 |
| 3618 | Split Array by Prime Indices | ArrayMathNumber Theory | Medium |
| 3619 | Count Islands With Total Value Divisible by K | ArrayDepth-First SearchBreadth-First Search+2 | Medium |
| 3620 | Network Recovery Pathways | ArrayBinary SearchDynamic Programming+4 | Hard |
| 3621 | Number of Integers With Popcount-Depth Equal to K I | MathDynamic ProgrammingCombinatorics | Hard |
| 3622 | Check Divisibility by Digit Sum and Product | Math | Easy |
| 3623 | Count Number of Trapezoids I | ArrayHash TableMath+1 | Medium |
| 3624 | Number of Integers With Popcount-Depth Equal to K II | ArraySegment Tree | Hard |
| 3625 | Count Number of Trapezoids II | ArrayHash TableMath+1 | Hard |