| 2090 | K Radius Subarray Averages | Medium | 1358 | arraysliding-window |
| 2095 | Delete the Middle Node of a Linked List | Medium | 1327 | linked-listtwo-pointers |
| 2101 | Detonate the Maximum Bombs | Medium | 1880 | arraymathdepth-first-search+3 |
| 2104 | Sum of Subarray Ranges | Medium | 1504 | arraystackmonotonic-stack |
| 2115 | Find All Possible Recipes from Given Supplies | Medium | 1679 | arrayhash-tablestring+2 |
| 2130 | Maximum Twin Sum of a Linked List | Medium | 1656 | linked-listtwo-pointersstack |
| 2135 | Count Words Obtained After Adding a Letter | Medium | 1699 | triebit-manipulationhash-table+1 |
| 2140 | Solving Questions With Brainpower | Medium | 1709 | arraydynamic-programming |
| 2192 | All Ancestors of a Node in a Directed Acyclic Graph | Medium | 1788 | depth-first-searchbreadth-first-searchgraph+1 |
| 2221 | Find Triangular Sum of an Array | Medium | 1317 | arraymathsimulation+2 |
| 2256 | Minimum Average Difference | Medium | 1393 | arrayprefix-sum |
| 2260 | Minimum Consecutive Cards to Pick Up | Medium | 1415 | arrayhash-tablesliding-window |
| 2275 | Largest Combination With Bitwise AND Greater Than Zero | Medium | 1642 | arrayhash-tablebit-manipulation+1 |
| 2280 | Minimum Lines to Represent a Line Chart | Medium | 1681 | arraymathgeometry+2 |
| 2289 | Steps to Make Array Non-decreasing | Medium | 2482 | arraylinked-listdynamic-programming+3 |
| 2300 | Successful Pairs of Spells and Potions | Medium | 1476 | arraytwo-pointersbinary-search+1 |
| 2316 | Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | 1604 | depth-first-searchbreadth-first-searchunion-find+1 |
| 2327 | Number of People Aware of a Secret | Medium | 1894 | dynamic-programmingqueuesimulation |
| 2336 | Smallest Number in Infinite Set | Medium | 1470 | hash-tableheapdesign |
| 2348 | Number of Zero-Filled Subarrays | Medium | 1316 | arraymath |
| 2349 | Design a Number Container System | Medium | 1540 | hash-tabledesignheap-priority-queue+1 |
| 2352 | Equal Row and Column Pairs | Medium | 1524 | arrayhash-tablematrix+1 |
| 2353 | Design a Food Rating System | Medium | 1782 | arrayhash-tablestring+3 |
| 2359 | Find Closest Node to Given Two Nodes | Medium | 1715 | depth-first-searchgraph |
| 2368 | Reachable Nodes With Restrictions | Medium | 1477 | arrayhash-tabletree+4 |
| 2369 | Check if There is a Valid Partition For The Array | Medium | 1780 | arraydynamic-programming |
| 2381 | Shifting Letters II | Medium | 1831 | arraystringprefix-sum |
| 2390 | Removing Stars From a String | Medium | 1347 | stringstacksimulation |
| 2401 | Longest Nice Subarray | Medium | 1749 | arraybit-manipulationsliding-window |
| 2405 | Optimal Partition of String | Medium | 1355 | hash-tablestringgreedy |
| 2406 | Divide Intervals Into Minimum Number of Groups | Medium | 1713 | arraytwo-pointersgreedy+3 |
| 2424 | Longest Uploaded Prefix | Medium | 1604 | hash-tablebinary-searchunion-find+5 |
| 2439 | Minimize Maximum of Array | Medium | 1965 | arraybinary-searchdynamic-programming+2 |
| 2461 | Maximum Sum of Distinct Subarrays With Length K | Medium | 1553 | arrayhash-tablesliding-window |
| 2462 | Total Cost to Hire K Workers | Medium | 1764 | arraytwo-pointersheap-priority-queue+1 |
| 2466 | Count Ways To Build Good Strings | Medium | 1694 | dynamic-programming |
| 2476 | Closest Nodes Queries in a Binary Search Tree | Medium | 1597 | arraybinary-searchtree+3 |
| 2477 | Minimum Fuel Cost to Report to the Capital | Medium | 2012 | treedepth-first-searchbreadth-first-search+1 |
| 2483 | Minimum Penalty for a Shop | Medium | 1495 | stringprefix-sum |
| 2487 | Remove Nodes From Linked List | Medium | 1455 | linked-liststackrecursion+1 |
| 2492 | Minimum Score of a Path Between Two Cities | Medium | 1680 | depth-first-searchbreadth-first-searchunion-find+1 |
| 2502 | Design Memory Allocator | Medium | 1746 | arrayhash-tabledesign+1 |
| 2507 | Smallest Value After Replacing With Sum of Prime Factors | Medium | 1500 | mathsimulationnumber-theory |
| 2516 | Take K of Each Character From Left and Right | Medium | 1660 | hash-tablestringsliding-window |
| 2526 | Find Consecutive Integers from a Data Stream | Medium | 1444 | hash-tabledesignqueue+2 |
| 2530 | Maximal Score After Applying K Operations | Medium | 1502 | arraygreedyheap-priority-queue |
| 2537 | Count the Number of Good Subarrays | Medium | 1664 | arrayhash-tablesliding-window+1 |
| 2542 | Maximum Subsequence Score | Medium | 2056 | arraysortingheap+1 |
| 2580 | Count Ways to Group Overlapping Ranges | Medium | 1553 | arraysorting |
| 2597 | The Number of Beautiful Subsets | Medium | 2023 | arrayhash-tablemath+4 |