| 2275 | Largest Combination With Bitwise AND Greater Than Zero | ArrayHash TableBit Manipulation+1 | Medium |
| 2279 | Maximum Bags With Full Capacity of Rocks | ArrayGreedySorting | Medium |
| 2280 | Minimum Lines to Represent a Line Chart | ArrayMathGeometry+2 | Medium |
| 2284 | Sender With Largest Word Count | ArrayHash TableString+1 | Medium |
| 2285 | Maximum Total Importance of Roads | GreedyGraphSorting+1 | Medium |
| 2288 | Apply Discount to Prices | String | Medium |
| 2289 | Steps to Make Array Non-decreasing | ArrayLinked ListStack+1 | Medium |
| 2294 | Partition Array Such That Maximum Difference Is K | ArrayGreedySorting | Medium |
| 2295 | Replace Elements in an Array | ArrayHash TableSimulation | Medium |
| 2300 | Successful Pairs of Spells and Potions | ArrayTwo PointersBinary Search+1 | Medium |
| 2304 | Minimum Path Cost in a Grid | ArrayDynamic ProgrammingMatrix | Medium |
| 2305 | Fair Distribution of Cookies | ArrayDynamic ProgrammingBacktracking+2 | Medium |
| 2310 | Sum of Numbers With Units Digit K | MathDynamic ProgrammingGreedy+1 | Medium |
| 2311 | Longest Binary Subsequence Less Than or Equal to K | StringDynamic ProgrammingGreedy+1 | Medium |
| 2316 | Count Unreachable Pairs of Nodes in an Undirected Graph | Depth-First SearchBreadth-First SearchUnion Find+1 | Medium |
| 2317 | Maximum XOR After Operations | ArrayMathBit Manipulation | Medium |
| 2320 | Count Number of Ways to Place Houses | Dynamic Programming | Medium |
| 2326 | Spiral Matrix IV | ArrayLinked ListMatrix+1 | Medium |
| 2327 | Number of People Aware of a Secret | Dynamic ProgrammingQueueSimulation | Medium |
| 2332 | The Latest Time to Catch a Bus | ArrayTwo PointersBinary Search+1 | Medium |
| 2333 | Minimum Sum of Squared Difference | ArrayBinary SearchGreedy+2 | Medium |
| 2336 | Smallest Number in Infinite Set | Hash TableDesignHeap (Priority Queue)+1 | Medium |
| 2337 | Move Pieces to Obtain a String | Two PointersString | Medium |
| 2342 | Max Sum of a Pair With Equal Sum of Digits | ArrayHash TableSorting+1 | Medium |
| 2343 | Query Kth Smallest Trimmed Number | ArrayStringDivide and Conquer+4 | Medium |
| 2348 | Number of Zero-Filled Subarrays | ArrayMath | Medium |
| 2349 | Design a Number Container System | Hash TableDesignHeap (Priority Queue)+1 | Medium |
| 2352 | Equal Row and Column Pairs | ArrayHash TableMatrix+1 | Medium |
| 2353 | Design a Food Rating System | ArrayHash TableString+3 | Medium |
| 2358 | Maximum Number of Groups Entering a Competition | ArrayMathBinary Search+1 | Medium |
| 2359 | Find Closest Node to Given Two Nodes | Depth-First SearchGraph | Medium |
| 2364 | Count Number of Bad Pairs | ArrayHash TableMath+1 | Medium |
| 2365 | Task Scheduler II | ArrayHash TableSimulation | Medium |
| 2368 | Reachable Nodes With Restrictions | ArrayHash TableTree+4 | Medium |
| 2369 | Check if There is a Valid Partition For The Array | ArrayDynamic Programming | Medium |
| 2370 | Longest Ideal Subsequence | Hash TableStringDynamic Programming | Medium |
| 2374 | Node With Highest Edge Score | Hash TableGraph | Medium |
| 2375 | Construct Smallest Number From DI String | StringBacktrackingStack+1 | Medium |
| 2380 | Time Needed to Rearrange a Binary String | StringDynamic ProgrammingSimulation | Medium |
| 2381 | Shifting Letters II | ArrayStringPrefix Sum | Medium |
| 2384 | Largest Palindromic Number | Hash TableStringGreedy+1 | Medium |
| 2385 | Amount of Time for Binary Tree to Be Infected | Hash TableTreeDepth-First Search+2 | Medium |
| 2390 | Removing Stars From a String | StringStackSimulation | Medium |
| 2391 | Minimum Amount of Time to Collect Garbage | ArrayStringPrefix Sum | Medium |
| 2396 | Strictly Palindromic Number | MathTwo PointersBrainteaser | Medium |
| 2397 | Maximum Rows Covered by Columns | ArrayBacktrackingBit Manipulation+2 | Medium |
| 2400 | Number of Ways to Reach a Position After Exactly k Steps | MathDynamic ProgrammingCombinatorics | Medium |
| 2401 | Longest Nice Subarray | ArrayBit ManipulationSliding Window | Medium |
| 2405 | Optimal Partition of String | Hash TableStringGreedy | Medium |
| 2406 | Divide Intervals Into Minimum Number of Groups | ArrayTwo PointersGreedy+3 | Medium |