| 1963 | Minimum Number of Swaps to Make the String Balanced | Medium | 1689 | two-pointersstringstack+1 |
| 1964 | Find the Longest Valid Obstacle Course at Each Position | Hard | 1933 | arraybinary-searchbinary-indexed-tree |
| 1968 | Array With Elements Not Equal to Average of Neighbors | Medium | 1499 | arraygreedysorting |
| 1971 | Find if Path Exists in Graph | Easy | — | depth-first-searchbreadth-first-searchunion-find+1 |
| 1976 | Number of Ways to Arrive at Destination | Medium | 2095 | dynamic-programminggraphtopological-sort+1 |
| 1980 | Find Unique Binary String | Medium | 1362 | arrayhash-tablestring+1 |
| 1984 | Minimum Difference Between Highest and Lowest of K Scores | Easy | 1306 | arraysliding-windowsorting |
| 1985 | Find the Kth Largest Integer in the Array | Medium | 1414 | arraystringdivide-and-conquer+3 |
| 1993 | Operations on Tree | Medium | 1861 | arrayhash-tabletree+3 |
| 1994 | The Number of Good Subsets | Hard | 2465 | arrayhash-tablemath+5 |
| 1998 | GCD Sort of an Array | Hard | 2429 | arraymathunion-find+2 |
| 2001 | Number of Pairs of Interchangeable Rectangles | Medium | 1436 | arrayhash-tablemath+2 |
| 2002 | Maximum Product of the Length of Two Palindromic Subsequences | Medium | 1869 | stringdynamic-programmingbacktracking+2 |
| 2013 | Detect Squares | Medium | 1678 | arrayhash-tabledesign+1 |
| 2014 | Longest Subsequence Repeated k Times | Hard | 2558 | hash-tabletwo-pointersstring+3 |
| 2017 | Grid Game | Medium | 1719 | arraymatrixprefix-sum |
| 2028 | Find Missing Observations | Medium | 1445 | arraymathsimulation |
| 2029 | Stone Game IX | Medium | 2277 | arraymathgreedy+2 |
| 2034 | Stock Price Fluctuation | Medium | 1832 | hash-tabledesignheap-priority-queue+2 |
| 2043 | Simple Bank System | Medium | 1356 | arrayhash-tabledesign+1 |
| 2044 | Count Number of Maximum Bitwise-OR Subsets | Medium | 1527 | bit-manipulationbacktrackingarray |
| 2045 | Second Minimum Time to Reach Destination | Hard | 2202 | breadth-first-searchgraphshortest-path |
| 2048 | Next Greater Numerically Balanced Number | Medium | 1734 | hash-tablemathbacktracking+2 |
| 2050 | Parallel Courses III | Hard | 2084 | arraydynamic-programminggraph+1 |
| 2056 | Number of Valid Move Combinations On Chessboard | Hard | 2611 | arraystringbacktracking+1 |
| 2065 | Maximum Path Quality of a Graph | Hard | 2178 | arraybacktrackinggraph |
| 2069 | Walking Robot Simulation II | Medium | 1919 | designsimulation |
| 2071 | Maximum Number of Tasks You Can Assign | Hard | 2648 | arraytwo-pointersbinary-search+4 |
| 2073 | Time Needed to Buy Tickets | Easy | 1325 | arrayqueuesimulation |
| 2076 | Process Restricted Friend Requests | Hard | 2131 | union-findgraph |
| 2080 | Range Frequency Queries | Medium | 1702 | arrayhash-tablebinary-search+2 |
| 2090 | K Radius Subarray Averages | Medium | 1358 | arraysliding-window |
| 2092 | Find All People With Secret | Hard | 2004 | depth-first-searchbreadth-first-searchunion-find+2 |
| 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 |
| 2102 | Sequentially Ordinal Rank Tracker | Hard | 2159 | designheap-priority-queuedata-stream+1 |
| 2104 | Sum of Subarray Ranges | Medium | 1504 | arraystackmonotonic-stack |
| 2115 | Find All Possible Recipes from Given Supplies | Medium | 1679 | arrayhash-tablestring+2 |
| 2127 | Maximum Employees to Be Invited to a Meeting | Hard | 2449 | arraydynamic-programmingdepth-first-search+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 |
| 2163 | Minimum Difference in Sums After Removal of Elements | Hard | 2175 | arraydynamic-programmingheap-priority-queue |
| 2179 | Count Good Triplets in an Array | Hard | 2272 | arraybinary-searchdivide-and-conquer+4 |
| 2183 | Count Array Pairs Divisible by K | Hard | 2246 | arrayhash-tablemath+2 |
| 2192 | All Ancestors of a Node in a Directed Acyclic Graph | Medium | 1788 | depth-first-searchbreadth-first-searchgraph+1 |
| 2203 | Minimum Weighted Subgraph With the Required Paths | Hard | 2364 | graphheap-priority-queueshortest-path |
| 2215 | Find the Difference of Two Arrays | Easy | 1207 | arrayhash-table |
| 2218 | Maximum Value of K Coins From Piles | Hard | 2158 | arraydynamic-programmingprefix-sum |
| 2221 | Find Triangular Sum of an Array | Medium | 1317 | arraymathsimulation+2 |