| 2365 | Task Scheduler II | ArrayHash TableSimulation | Medium |
| 2366 | Minimum Replacements to Sort the Array | ArrayMathGreedy | Hard |
| 2367 | Number of Arithmetic Triplets | ArrayHash TableTwo Pointers+1 | Easy |
| 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 |
| 2373 | Largest Local Values in a Matrix | ArrayMatrix | Easy |
| 2374 | Node With Highest Edge Score | Hash TableGraph | Medium |
| 2375 | Construct Smallest Number From DI String | StringBacktrackingStack+1 | Medium |
| 2376 | Count Special Integers | MathDynamic Programming | Hard |
| 2379 | Minimum Recolors to Get K Consecutive Black Blocks | StringSliding Window | Easy |
| 2380 | Time Needed to Rearrange a Binary String | StringDynamic ProgrammingSimulation | Medium |
| 2381 | Shifting Letters II | ArrayStringPrefix Sum | Medium |
| 2382 | Maximum Segment Sum After Removals | ArrayUnion FindPrefix Sum+1 | Hard |
| 2383 | Minimum Hours of Training to Win a Competition | ArrayGreedy | Easy |
| 2384 | Largest Palindromic Number | Hash TableStringGreedy+1 | Medium |
| 2385 | Amount of Time for Binary Tree to Be Infected | Hash TableTreeDepth-First Search+2 | Medium |
| 2386 | Find the K-Sum of an Array | ArraySortingHeap (Priority Queue) | Hard |
| 2389 | Longest Subsequence With Limited Sum | ArrayBinary SearchGreedy+2 | Easy |
| 2390 | Removing Stars From a String | StringStackSimulation | Medium |
| 2391 | Minimum Amount of Time to Collect Garbage | ArrayStringPrefix Sum | Medium |
| 2392 | Build a Matrix With Conditions | ArrayGraphTopological Sort+1 | Hard |
| 2395 | Find Subarrays With Equal Sum | ArrayHash Table | Easy |
| 2396 | Strictly Palindromic Number | MathTwo PointersBrainteaser | Medium |
| 2397 | Maximum Rows Covered by Columns | ArrayBacktrackingBit Manipulation+2 | Medium |
| 2398 | Maximum Number of Robots Within Budget | ArrayBinary SearchQueue+4 | Hard |
| 2399 | Check Distances Between Same Letters | ArrayHash TableString | Easy |
| 2400 | Number of Ways to Reach a Position After Exactly k Steps | MathDynamic ProgrammingCombinatorics | Medium |
| 2401 | Longest Nice Subarray | ArrayBit ManipulationSliding Window | Medium |
| 2402 | Meeting Rooms III | ArrayHash TableSorting+2 | Hard |
| 2404 | Most Frequent Even Element | ArrayHash TableCounting | Easy |
| 2405 | Optimal Partition of String | Hash TableStringGreedy | Medium |
| 2406 | Divide Intervals Into Minimum Number of Groups | ArrayTwo PointersGreedy+3 | Medium |
| 2407 | Longest Increasing Subsequence II | ArrayDivide and ConquerDynamic Programming+4 | Hard |
| 2409 | Count Days Spent Together | MathString | Easy |
| 2410 | Maximum Matching of Players With Trainers | ArrayTwo PointersGreedy+1 | Medium |
| 2411 | Smallest Subarrays With Maximum Bitwise OR | ArrayBinary SearchBit Manipulation+1 | Medium |
| 2412 | Minimum Money Required Before Transactions | ArrayGreedySorting | Hard |
| 2413 | Smallest Even Multiple | MathNumber Theory | Easy |
| 2414 | Length of the Longest Alphabetical Continuous Substring | String | Medium |
| 2415 | Reverse Odd Levels of Binary Tree | TreeDepth-First SearchBreadth-First Search+1 | Medium |
| 2416 | Sum of Prefix Scores of Strings | ArrayStringTrie+1 | Hard |
| 2418 | Sort the People | ArrayHash TableString+1 | Easy |
| 2419 | Longest Subarray With Maximum Bitwise AND | ArrayBit ManipulationBrainteaser | Medium |
| 2420 | Find All Good Indices | ArrayDynamic ProgrammingPrefix Sum | Medium |
| 2421 | Number of Good Paths | ArrayHash TableTree+3 | Hard |
| 2423 | Remove Letter To Equalize Frequency | Hash TableStringCounting | Easy |
| 2424 | Longest Uploaded Prefix | Hash TableBinary SearchUnion Find+5 | Medium |
| 2425 | Bitwise XOR of All Pairings | ArrayBit ManipulationBrainteaser | Medium |
| 2426 | Number of Pairs Satisfying Inequality | ArrayBinary SearchDivide and Conquer+4 | Hard |