| 3139 | Minimum Cost to Equalize Array | ArrayGreedyEnumeration | Hard |
| 3145 | Find Products of Elements of Big Array | ArrayBinary SearchBit Manipulation | Hard |
| 3149 | Find the Minimum Cost Array Permutation | ArrayDynamic ProgrammingBit Manipulation+1 | Hard |
| 3154 | Find Number of Ways to Reach the K-th Stair | MathDynamic ProgrammingBit Manipulation+2 | Hard |
| 3161 | Block Placement Queries | ArrayBinary SearchBinary Indexed Tree+1 | Hard |
| 3165 | Maximum Sum of Subsequence With Non-adjacent Elements | ArrayDivide and ConquerDynamic Programming+1 | Hard |
| 3171 | Find Subarray With Bitwise OR Closest to K | ArrayBinary SearchBit Manipulation+1 | Hard |
| 3177 | Find the Maximum Length of a Good Subsequence II | ArrayHash TableDynamic Programming | Hard |
| 3181 | Maximum Total Reward Using Operations II | ArrayDynamic ProgrammingBit Manipulation | Hard |
| 3187 | Peaks in Array | ArrayBinary Indexed TreeSegment Tree | Hard |
| 3193 | Count the Number of Inversions | ArrayDynamic Programming | Hard |
| 3197 | Find the Minimum Area to Cover All Ones II | ArrayMatrixEnumeration | Hard |
| 3203 | Find Minimum Diameter After Merging Two Trees | TreeDepth-First SearchBreadth-First Search+1 | Hard |
| 3209 | Number of Subarrays With AND Value of K | ArrayBinary SearchBit Manipulation+1 | Hard |
| 3213 | Construct String with Minimum Cost | ArrayStringDynamic Programming+1 | Hard |
| 3219 | Minimum Cost for Cutting Cake II | ArrayGreedySorting | Hard |
| 3225 | Maximum Score From Grid Operations | ArrayDynamic ProgrammingMatrix+1 | Hard |
| 3229 | Minimum Operations to Make Array Equal to Target | ArrayDynamic ProgrammingStack+2 | Hard |
| 3235 | Check if the Rectangle Corner Is Reachable | ArrayMathDepth-First Search+3 | Hard |
| 3241 | Time Taken to Mark All Nodes | Dynamic ProgrammingTreeDepth-First Search+1 | Hard |
| 3244 | Shortest Distance After Road Addition Queries II | ArrayGreedyGraph+1 | Hard |
| 3245 | Alternating Groups III | ArrayBinary Indexed Tree | Hard |
| 3250 | Find the Count of Monotonic Pairs I | ArrayMathDynamic Programming+2 | Hard |
| 3251 | Find the Count of Monotonic Pairs II | ArrayMathDynamic Programming+2 | Hard |
| 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 |
| 3260 | Find the Largest Palindrome Divisible by K | MathStringDynamic Programming+2 | Hard |
| 3261 | Count Substrings That Satisfy K-Constraint II | ArrayStringBinary Search+2 | Hard |
| 3266 | Final Array State After K Multiplication Operations II | ArrayHeap (Priority Queue)Simulation | Hard |
| 3267 | Count Almost Equal Pairs II | ArrayHash TableSorting+2 | Hard |
| 3272 | Find the Count of Good Integers | Hash TableMathCombinatorics+1 | Hard |
| 3273 | Minimum Amount of Damage Dealt to Bob | ArrayGreedySorting | Hard |
| 3276 | Select Cells in Grid With Maximum Score | ArrayDynamic ProgrammingBit Manipulation+2 | Hard |
| 3277 | Maximum XOR Score Subarray Queries | ArrayDynamic Programming | Hard |
| 3283 | Maximum Number of Moves to Kill All Pawns | ArrayMathBit Manipulation+3 | Hard |
| 3287 | Find the Maximum Sequence Value of Array | ArrayDynamic ProgrammingBit Manipulation | Hard |
| 3288 | Length of the Longest Increasing Path | ArrayBinary SearchSorting | Hard |
| 3292 | Minimum Number of Valid Strings to Form Target II | ArrayStringBinary Search+5 | Hard |
| 3298 | Count Substrings That Can Be Rearranged to Contain a String II | Hash TableStringSliding Window | Hard |
| 3303 | Find the Occurrence of First Almost Equal Substring | StringString Matching | Hard |
| 3307 | Find the K-th Character in String Game II | MathBit ManipulationRecursion | Hard |
| 3311 | Construct 2D Grid Matching Graph Layout | ArrayHash TableGraph+1 | Hard |
| 3312 | Sorted GCD Pair Queries | ArrayHash TableMath+5 | Hard |
| 3317 | Find the Number of Possible Ways for an Event | MathDynamic ProgrammingCombinatorics | Hard |
| 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 |
| 3327 | Check if DFS Strings Are Palindromes | ArrayHash TableString+3 | Hard |
| 3333 | Find the Original Typed String II | StringDynamic ProgrammingPrefix Sum | Hard |
| 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 |