| 3455 | Shortest Matching Substring | Two PointersStringBinary Search+1 | Hard |
| 3456 | Find Special Substring of Length K | String | Easy |
| 3457 | Eat Pizzas! | ArrayGreedySorting | Medium |
| 3458 | Select K Disjoint Special Substrings | Hash TableStringDynamic Programming+2 | Medium |
| 3459 | Length of Longest V-Shaped Diagonal Segment | ArrayDynamic ProgrammingMemoization+1 | Hard |
| 3461 | Check If Digits Are Equal in String After Operations I | MathStringSimulation+2 | Easy |
| 3462 | Maximum Sum With at Most K Elements | ArrayGreedySorting+2 | Medium |
| 3463 | Check If Digits Are Equal in String After Operations II | MathStringCombinatorics+1 | Hard |
| 3464 | Maximize the Distance Between Points on a Square | ArrayBinary SearchGreedy | Hard |
| 3465 | Find Products with Valid Serial Numbers | Database | Easy |
| 3467 | Transform Array by Parity | ArraySortingCounting | Easy |
| 3468 | Find the Number of Copy Arrays | ArrayMath | Medium |
| 3469 | Find Minimum Cost to Remove Array Elements | ArrayDynamic Programming | Medium |
| 3470 | Permutations IV | ArrayMathCombinatorics+1 | Hard |
| 3471 | Find the Largest Almost Missing Integer | ArrayHash Table | Easy |
| 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 |
| 3474 | Lexicographically Smallest Generated String | StringGreedyString Matching | Hard |
| 3475 | DNA Pattern Recognition | Database | Medium |
| 3477 | Fruits Into Baskets II | ArrayBinary SearchSegment Tree+2 | Easy |
| 3478 | Choose K Elements With Maximum Sum | ArraySortingHeap (Priority Queue) | Medium |
| 3479 | Fruits Into Baskets III | ArrayBinary SearchSegment Tree+1 | Medium |
| 3480 | Maximize Subarrays After Removing One Conflicting Pair | ArraySegment TreeEnumeration+1 | Hard |
| 3482 | Analyze Organization Hierarchy | Database | Hard |
| 3483 | Unique 3-Digit Even Numbers | ArrayHash TableRecursion+1 | Easy |
| 3484 | Design Spreadsheet | ArrayHash TableString+2 | Medium |
| 3485 | Longest Common Prefix of K Strings After Removal | ArrayStringTrie | Hard |
| 3486 | Longest Special Path II | ArrayHash TableTree+2 | Hard |
| 3487 | Maximum Unique Subarray Sum After Deletion | ArrayHash TableGreedy | Easy |
| 3488 | Closest Equal Element Queries | ArrayHash TableBinary Search | Medium |
| 3489 | Zero Array Transformation IV | ArrayDynamic Programming | Medium |
| 3490 | Count Beautiful Numbers | Dynamic Programming | Hard |
| 3492 | Maximum Containers on a Ship | Math | Easy |
| 3493 | Properties Graph | ArrayHash TableDepth-First Search+3 | Medium |
| 3494 | Find the Minimum Amount of Time to Brew Potions | ArraySimulationPrefix Sum | Medium |
| 3495 | Minimum Operations to Make Array Elements Zero | ArrayMathBit Manipulation | Hard |
| 3497 | Analyze Subscription Conversion | Database | Medium |
| 3498 | Reverse Degree of a String | StringSimulation | Easy |
| 3499 | Maximize Active Section with Trade I | StringEnumeration | Medium |
| 3500 | Minimum Cost to Divide Array Into Subarrays | ArrayDynamic ProgrammingPrefix Sum | Hard |
| 3501 | Maximize Active Section with Trade II | ArrayStringBinary Search+1 | Hard |
| 3502 | Minimum Cost to Reach Every Position | Array | Easy |
| 3503 | Longest Palindrome After Substring Concatenation I | Two PointersStringDynamic Programming+1 | Medium |
| 3504 | Longest Palindrome After Substring Concatenation II | Two PointersStringDynamic Programming | Hard |
| 3505 | Minimum Operations to Make Elements Within K Subarrays Equal | ArrayHash TableMath+3 | Hard |
| 3507 | Minimum Pair Removal to Sort Array I | ArrayHash TableLinked List+4 | Easy |
| 3508 | Implement Router | ArrayHash TableBinary Search+3 | Medium |
| 3509 | Maximum Product of Subsequences With an Alternating Sum Equal to K | ArrayHash TableDynamic Programming | Hard |
| 3510 | Minimum Pair Removal to Sort Array II | ArrayHash TableLinked List+4 | Hard |
| 3512 | Minimum Operations to Make Array Sum Divisible by K | ArrayMath | Easy |