| 3333 | Find the Original Typed String II | StringDynamic ProgrammingPrefix Sum | Hard |
| 3334 | Find the Maximum Factor Score of Array | ArrayMathNumber Theory | Medium |
| 3335 | Total Characters in String After Transformations I | Hash TableMathString+2 | Medium |
| 3336 | Find the Number of Subsequences With Equal GCD | ArrayMathDynamic Programming+1 | Hard |
| 3337 | Total Characters in String After Transformations II | Hash TableMathString+2 | Hard |
| 3340 | Check Balanced String | String | Easy |
| 3341 | Find Minimum Time to Reach Last Room I | ArrayGraphHeap (Priority Queue)+2 | Medium |
| 3342 | Find Minimum Time to Reach Last Room II | ArrayGraphHeap (Priority Queue)+2 | Medium |
| 3343 | Count Number of Balanced Permutations | MathStringDynamic Programming+1 | Hard |
| 3345 | Smallest Divisible Digit Product I | MathEnumeration | Easy |
| 3346 | Maximum Frequency of an Element After Performing Operations I | ArrayBinary SearchSliding Window+2 | Medium |
| 3347 | Maximum Frequency of an Element After Performing Operations II | ArrayBinary SearchSliding Window+2 | Hard |
| 3348 | Smallest Divisible Digit Product II | MathStringBacktracking+2 | Hard |
| 3349 | Adjacent Increasing Subarrays Detection I | Array | Easy |
| 3350 | Adjacent Increasing Subarrays Detection II | ArrayBinary Search | Medium |
| 3351 | Sum of Good Subsequences | ArrayHash TableDynamic Programming | Hard |
| 3352 | Count K-Reducible Numbers Less Than N | MathStringDynamic Programming+1 | Hard |
| 3354 | Make Array Elements Equal to Zero | ArraySimulationPrefix Sum | Easy |
| 3355 | Zero Array Transformation I | ArrayPrefix Sum | Medium |
| 3356 | Zero Array Transformation II | ArrayBinary SearchPrefix Sum | Medium |
| 3357 | Minimize the Maximum Adjacent Element Difference | ArrayBinary SearchGreedy | Hard |
| 3360 | Stone Removal Game | MathSimulation | Easy |
| 3361 | Shift Distance Between Two Strings | ArrayStringPrefix Sum | Medium |
| 3362 | Zero Array Transformation III | ArrayGreedySorting+2 | Medium |
| 3363 | Find the Maximum Number of Fruits Collected | ArrayDynamic ProgrammingMatrix | Hard |
| 3364 | Minimum Positive Sum Subarray | ArraySliding WindowPrefix Sum | Easy |
| 3365 | Rearrange K Substrings to Form Target String | Hash TableStringSorting | Medium |
| 3366 | Minimum Array Sum | ArrayDynamic Programming | Medium |
| 3367 | Maximize Sum of Weights after Edge Removals | Dynamic ProgrammingTreeDepth-First Search | Hard |
| 3370 | Smallest Number With All Set Bits | MathBit Manipulation | Easy |
| 3371 | Identify the Largest Outlier in an Array | ArrayHash TableCounting+1 | Medium |
| 3372 | Maximize the Number of Target Nodes After Connecting Trees I | TreeDepth-First SearchBreadth-First Search | Medium |
| 3373 | Maximize the Number of Target Nodes After Connecting Trees II | TreeDepth-First SearchBreadth-First Search | Hard |
| 3374 | First Letter Capitalization II | Database | Hard |
| 3375 | Minimum Operations to Make Array Values Equal to K | ArrayHash Table | Easy |
| 3376 | Minimum Time to Break Locks I | ArrayDynamic ProgrammingBacktracking+3 | Medium |
| 3377 | Digit Operations to Make Two Integers Equal | MathGraphHeap (Priority Queue)+2 | Medium |
| 3378 | Count Connected Components in LCM Graph | ArrayHash TableMath+2 | Hard |
| 3379 | Transformed Array | ArraySimulation | Easy |
| 3380 | Maximum Area Rectangle With Point Constraints I | ArrayMathBinary Indexed Tree+4 | Medium |
| 3381 | Maximum Subarray Sum With Length Divisible by K | ArrayHash TablePrefix Sum | Medium |
| 3382 | Maximum Area Rectangle With Point Constraints II | ArrayMathBinary Indexed Tree+3 | Hard |
| 3386 | Button with Longest Push Time | Array | Easy |
| 3387 | Maximize Amount After Two Days of Conversions | ArrayStringDepth-First Search+2 | Medium |
| 3388 | Count Beautiful Splits in an Array | ArrayDynamic Programming | Medium |
| 3389 | Minimum Operations to Make Character Frequencies Equal | Hash TableStringDynamic Programming+2 | Hard |
| 3392 | Count Subarrays of Length Three With a Condition | Array | Easy |
| 3393 | Count Paths With the Given XOR Value | ArrayDynamic ProgrammingBit Manipulation+1 | Medium |
| 3394 | Check if Grid can be Cut into Sections | ArraySorting | Medium |
| 3395 | Subsequences with a Unique Middle Mode I | ArrayHash TableMath+1 | Hard |