| 3206 | Alternating Groups I | ArraySliding Window | Easy |
| 3207 | Maximum Points After Enemy Battles | ArrayGreedy | Medium |
| 3208 | Alternating Groups II | ArraySliding Window | Medium |
| 3209 | Number of Subarrays With AND Value of K | ArrayBinary SearchBit Manipulation+1 | Hard |
| 3210 | Find the Encrypted String | String | Easy |
| 3211 | Generate Binary Strings Without Adjacent Zeros | StringBacktrackingBit Manipulation | Medium |
| 3212 | Count Submatrices With Equal Frequency of X and Y | ArrayMatrixPrefix Sum | Medium |
| 3213 | Construct String with Minimum Cost | ArrayStringDynamic Programming+1 | Hard |
| 3216 | Lexicographically Smallest String After a Swap | StringGreedy | Easy |
| 3217 | Delete Nodes From Linked List Present in Array | ArrayHash TableLinked List | Medium |
| 3218 | Minimum Cost for Cutting Cake I | ArrayDynamic ProgrammingGreedy+1 | Medium |
| 3219 | Minimum Cost for Cutting Cake II | ArrayGreedySorting | Hard |
| 3220 | Odd and Even Transactions | Database | Medium |
| 3222 | Find the Winning Player in Coin Game | MathSimulationGame Theory | Easy |
| 3223 | Minimum Length of String After Operations | Hash TableStringCounting | Medium |
| 3224 | Minimum Array Changes to Make Differences Equal | ArrayHash TablePrefix Sum | Medium |
| 3225 | Maximum Score From Grid Operations | ArrayDynamic ProgrammingMatrix+1 | Hard |
| 3226 | Number of Bit Changes to Make Two Integers Equal | Bit Manipulation | Easy |
| 3227 | Vowels Game in a String | MathStringBrainteaser+1 | Medium |
| 3228 | Maximum Number of Operations to Move Ones to the End | StringGreedyCounting | Medium |
| 3229 | Minimum Operations to Make Array Equal to Target | ArrayDynamic ProgrammingStack+2 | Hard |
| 3232 | Find if Digit Game Can Be Won | ArrayMath | Easy |
| 3233 | Find the Count of Numbers Which Are Not Special | ArrayMathNumber Theory | Medium |
| 3234 | Count the Number of Substrings With Dominant Ones | StringSliding WindowEnumeration | Medium |
| 3235 | Check if the Rectangle Corner Is Reachable | ArrayMathDepth-First Search+3 | Hard |
| 3238 | Find the Number of Winning Players | ArrayHash TableCounting | Easy |
| 3239 | Minimum Number of Flips to Make Binary Grid Palindromic I | ArrayTwo PointersMatrix | Medium |
| 3240 | Minimum Number of Flips to Make Binary Grid Palindromic II | ArrayTwo PointersMatrix | Medium |
| 3241 | Time Taken to Mark All Nodes | Dynamic ProgrammingTreeDepth-First Search+1 | Hard |
| 3242 | Design Neighbor Sum Service | ArrayHash TableDesign+2 | Easy |
| 3243 | Shortest Distance After Road Addition Queries I | ArrayBreadth-First SearchGraph | Medium |
| 3244 | Shortest Distance After Road Addition Queries II | ArrayGreedyGraph+1 | Hard |
| 3245 | Alternating Groups III | ArrayBinary Indexed Tree | Hard |
| 3248 | Snake in Matrix | ArrayStringSimulation | Easy |
| 3249 | Count the Number of Good Nodes | TreeDepth-First Search | Medium |
| 3250 | Find the Count of Monotonic Pairs I | ArrayMathDynamic Programming+2 | Hard |
| 3251 | Find the Count of Monotonic Pairs II | ArrayMathDynamic Programming+2 | Hard |
| 3254 | Find the Power of K-Size Subarrays I | ArraySliding Window | Medium |
| 3255 | Find the Power of K-Size Subarrays II | ArraySliding Window | Medium |
| 3256 | Maximum Value Sum by Placing Three Rooks I | ArrayDynamic ProgrammingMatrix+1 | Hard |
| 3257 | Maximum Value Sum by Placing Three Rooks II | ArrayDynamic ProgrammingMatrix+1 | Hard |
| 3258 | Count Substrings That Satisfy K-Constraint I | StringSliding Window | Easy |
| 3259 | Maximum Energy Boost From Two Drinks | ArrayDynamic Programming | Medium |
| 3260 | Find the Largest Palindrome Divisible by K | MathStringDynamic Programming+2 | Hard |
| 3261 | Count Substrings That Satisfy K-Constraint II | ArrayStringBinary Search+2 | Hard |
| 3264 | Final Array State After K Multiplication Operations I | ArrayMathHeap (Priority Queue)+1 | Easy |
| 3265 | Count Almost Equal Pairs I | ArrayHash TableSorting+2 | Medium |
| 3266 | Final Array State After K Multiplication Operations II | ArrayHeap (Priority Queue)Simulation | Hard |
| 3267 | Count Almost Equal Pairs II | ArrayHash TableSorting+2 | Hard |
| 3270 | Find the Key of the Numbers | Math | Easy |