| 3271 | Hash Divided String | StringSimulation | Medium |
| 3272 | Find the Count of Good Integers | Hash TableMathCombinatorics+1 | Hard |
| 3273 | Minimum Amount of Damage Dealt to Bob | ArrayGreedySorting | Hard |
| 3274 | Check if Two Chessboard Squares Have the Same Color | MathString | Easy |
| 3275 | K-th Nearest Obstacle Queries | ArrayHeap (Priority Queue) | Medium |
| 3276 | Select Cells in Grid With Maximum Score | ArrayDynamic ProgrammingBit Manipulation+2 | Hard |
| 3277 | Maximum XOR Score Subarray Queries | ArrayDynamic Programming | Hard |
| 3280 | Convert Date to Binary | MathString | Easy |
| 3281 | Maximize Score of Numbers in Ranges | ArrayBinary SearchGreedy+1 | Medium |
| 3282 | Reach End of Array With Max Score | ArrayGreedy | Medium |
| 3283 | Maximum Number of Moves to Kill All Pawns | ArrayMathBit Manipulation+3 | Hard |
| 3285 | Find Indices of Stable Mountains | Array | Easy |
| 3286 | Find a Safe Walk Through a Grid | ArrayBreadth-First SearchGraph+3 | Medium |
| 3287 | Find the Maximum Sequence Value of Array | ArrayDynamic ProgrammingBit Manipulation | Hard |
| 3288 | Length of the Longest Increasing Path | ArrayBinary SearchSorting | Hard |
| 3289 | The Two Sneaky Numbers of Digitville | ArrayHash TableMath | Easy |
| 3290 | Maximum Multiplication Score | ArrayDynamic Programming | Medium |
| 3291 | Minimum Number of Valid Strings to Form Target I | ArrayStringBinary Search+6 | Medium |
| 3292 | Minimum Number of Valid Strings to Form Target II | ArrayStringBinary Search+5 | Hard |
| 3295 | Report Spam Message | ArrayHash TableString | Medium |
| 3296 | Minimum Number of Seconds to Make Mountain Height Zero | ArrayMathBinary Search+2 | Medium |
| 3297 | Count Substrings That Can Be Rearranged to Contain a String I | Hash TableStringSliding Window | Medium |
| 3298 | Count Substrings That Can Be Rearranged to Contain a String II | Hash TableStringSliding Window | Hard |
| 3300 | Minimum Element After Replacement With Digit Sum | ArrayMath | Easy |
| 3301 | Maximize the Total Height of Unique Towers | ArrayGreedySorting | Medium |
| 3302 | Find the Lexicographically Smallest Valid Sequence | Two PointersStringDynamic Programming+1 | Medium |
| 3303 | Find the Occurrence of First Almost Equal Substring | StringString Matching | Hard |
| 3304 | Find the K-th Character in String Game I | MathBit ManipulationRecursion+1 | Easy |
| 3305 | Count of Substrings Containing Every Vowel and K Consonants I | Hash TableStringSliding Window | Medium |
| 3306 | Count of Substrings Containing Every Vowel and K Consonants II | Hash TableStringSliding Window | Medium |
| 3307 | Find the K-th Character in String Game II | MathBit ManipulationRecursion | Hard |
| 3309 | Maximum Possible Number by Binary Concatenation | ArrayBit ManipulationEnumeration | Medium |
| 3310 | Remove Methods From Project | Depth-First SearchBreadth-First SearchGraph | Medium |
| 3311 | Construct 2D Grid Matching Graph Layout | ArrayHash TableGraph+1 | Hard |
| 3312 | Sorted GCD Pair Queries | ArrayHash TableMath+5 | Hard |
| 3314 | Construct the Minimum Bitwise Array I | ArrayBit Manipulation | Easy |
| 3315 | Construct the Minimum Bitwise Array II | ArrayBit Manipulation | Medium |
| 3316 | Find Maximum Removals From Source String | ArrayHash TableTwo Pointers+2 | Medium |
| 3317 | Find the Number of Possible Ways for an Event | MathDynamic ProgrammingCombinatorics | Hard |
| 3318 | Find X-Sum of All K-Long Subarrays I | ArrayHash TableSliding Window+1 | Easy |
| 3319 | K-th Largest Perfect Subtree Size in Binary Tree | TreeDepth-First SearchSorting+1 | Medium |
| 3320 | Count The Number of Winning Sequences | StringDynamic Programming | Hard |
| 3321 | Find X-Sum of All K-Long Subarrays II | ArrayHash TableSliding Window+1 | Hard |
| 3324 | Find the Sequence of Strings Appeared on the Screen | StringSimulation | Medium |
| 3325 | Count Substrings With K-Frequency Characters I | Hash TableStringSliding Window | Medium |
| 3326 | Minimum Division Operations to Make Array Non Decreasing | ArrayMathGreedy+1 | Medium |
| 3327 | Check if DFS Strings Are Palindromes | ArrayHash TableString+3 | Hard |
| 3330 | Find the Original Typed String I | String | Easy |
| 3331 | Find Subtree Sizes After Changes | ArrayHash TableString+2 | Medium |
| 3332 | Maximum Points Tourist Can Earn | ArrayDynamic ProgrammingMatrix | Medium |