| 2300 | Successful Pairs of Spells and Potions | ArrayTwo PointersBinary Search+1 | Medium |
| 2301 | Match Substring After Replacement | ArrayHash TableString+1 | Hard |
| 2302 | Count Subarrays With Score Less Than K | ArrayBinary SearchSliding Window+1 | Hard |
| 2303 | Calculate Amount Paid in Taxes | ArraySimulation | Easy |
| 2304 | Minimum Path Cost in a Grid | ArrayDynamic ProgrammingMatrix | Medium |
| 2305 | Fair Distribution of Cookies | ArrayDynamic ProgrammingBacktracking+2 | Medium |
| 2306 | Naming a Company | ArrayHash TableString+2 | Hard |
| 2309 | Greatest English Letter in Upper and Lower Case | Hash TableStringEnumeration | Easy |
| 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 |
| 2312 | Selling Pieces of Wood | ArrayDynamic ProgrammingMemoization | Hard |
| 2315 | Count Asterisks | String | Easy |
| 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 |
| 2318 | Number of Distinct Roll Sequences | Dynamic ProgrammingMemoization | Hard |
| 2319 | Check if Matrix Is X-Matrix | ArrayMatrix | Easy |
| 2320 | Count Number of Ways to Place Houses | Dynamic Programming | Medium |
| 2321 | Maximum Score Of Spliced Array | ArrayDynamic Programming | Hard |
| 2322 | Minimum Score After Removals on a Tree | ArrayBit ManipulationTree+1 | Hard |
| 2325 | Decode the Message | Hash TableString | Easy |
| 2326 | Spiral Matrix IV | ArrayLinked ListMatrix+1 | Medium |
| 2327 | Number of People Aware of a Secret | Dynamic ProgrammingQueueSimulation | Medium |
| 2328 | Number of Increasing Paths in a Grid | ArrayDynamic ProgrammingDepth-First Search+5 | Hard |
| 2331 | Evaluate Boolean Binary Tree | TreeDepth-First SearchBinary Tree | Easy |
| 2332 | The Latest Time to Catch a Bus | ArrayTwo PointersBinary Search+1 | Medium |
| 2333 | Minimum Sum of Squared Difference | ArrayBinary SearchGreedy+2 | Medium |
| 2334 | Subarray With Elements Greater Than Varying Threshold | ArrayStackUnion Find+1 | Hard |
| 2335 | Minimum Amount of Time to Fill Cups | ArrayGreedySorting+1 | Easy |
| 2336 | Smallest Number in Infinite Set | Hash TableDesignHeap (Priority Queue)+1 | Medium |
| 2337 | Move Pieces to Obtain a String | Two PointersString | Medium |
| 2338 | Count the Number of Ideal Arrays | MathDynamic ProgrammingCombinatorics+1 | Hard |
| 2341 | Maximum Number of Pairs in Array | ArrayHash TableCounting | Easy |
| 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 |
| 2344 | Minimum Deletions to Make Array Divisible | ArrayMathSorting+2 | Hard |
| 2347 | Best Poker Hand | ArrayHash TableCounting | Easy |
| 2348 | Number of Zero-Filled Subarrays | ArrayMath | Medium |
| 2349 | Design a Number Container System | Hash TableDesignHeap (Priority Queue)+1 | Medium |
| 2350 | Shortest Impossible Sequence of Rolls | ArrayHash TableGreedy | Hard |
| 2351 | First Letter to Appear Twice | Hash TableStringBit Manipulation+1 | Easy |
| 2352 | Equal Row and Column Pairs | ArrayHash TableMatrix+1 | Medium |
| 2353 | Design a Food Rating System | ArrayHash TableString+3 | Medium |
| 2354 | Number of Excellent Pairs | ArrayHash TableBinary Search+1 | Hard |
| 2356 | Number of Unique Subjects Taught by Each Teacher | Database | Easy |
| 2357 | Make Array Zero by Subtracting Equal Amounts | ArrayHash TableGreedy+3 | Easy |
| 2358 | Maximum Number of Groups Entering a Competition | ArrayMathBinary Search+1 | Medium |
| 2359 | Find Closest Node to Given Two Nodes | Depth-First SearchGraph | Medium |
| 2360 | Longest Cycle in a Graph | Depth-First SearchBreadth-First SearchGraph+1 | Hard |
| 2363 | Merge Similar Items | ArrayHash TableSorting+1 | Easy |
| 2364 | Count Number of Bad Pairs | ArrayHash TableMath+1 | Medium |