| 1609 | Even Odd Tree | Medium | 1749 | treebfsbinary-tree |
| 1626 | Best Team With No Conflicts | Medium | 2027 | arraydynamic-programmingsorting |
| 1631 | Path With Minimum Effort | Medium | 1947 | arraybinary-searchdepth-first-search+4 |
| 1642 | Furthest Building You Can Reach | Medium | 1536 | arraygreedyheap-priority-queue |
| 1647 | Minimum Deletions to Make Character Frequencies Unique | Medium | 1510 | hash-tablestringgreedy+1 |
| 1650 | Lowest Common Ancestor of a Binary Tree III | Medium | — | treehash-tabletwo-pointers |
| 1657 | Determine if Two Strings Are Close | Medium | 1530 | hash-tablestringsorting+1 |
| 1658 | Minimum Operations to Reduce X to Zero | Medium | 1817 | arrayhash-tablebinary-search+3 |
| 1670 | Design Front Middle Back Queue | Medium | 1610 | arraylinked-listdesign+3 |
| 1679 | Max Number of K-Sum Pairs | Medium | 1346 | arrayhash-tablesorting+1 |
| 1685 | Sum of Absolute Differences in a Sorted Array | Medium | 1661 | arraymathprefix-sum |
| 1695 | Maximum Erasure Value | Medium | 1528 | arrayhash-tablesliding-window |
| 1696 | Jump Game VI | Medium | 1954 | arraydynamic-programmingqueue+2 |
| 1721 | Swapping Nodes in a Linked List | Medium | 1561 | linked-listtwo-pointers |
| 1762 | Buildings With an Ocean View | Medium | — | arraystackmonotonic-stack |
| 1786 | Number of Restricted Paths From First to Last Node | Medium | 2079 | dynamic-programminggraphtopological-sort+2 |
| 1823 | Find the Winner of the Circular Game | Medium | 1412 | arraymathrecursion+2 |
| 1834 | Single-Threaded CPU | Medium | 1798 | arraysortingheap-priority-queue |
| 1838 | Frequency of the Most Frequent Element | Medium | 1876 | arraybinary-searchgreedy+3 |
| 1845 | Seat Reservation Manager | Medium | 1429 | designheap-priority-queue |
| 1849 | Splitting a String Into Descending Consecutive Values | Medium | 1747 | stringbacktrackingenumeration |
| 1856 | Maximum Subarray Min-Product | Medium | 2051 | arraystackmonotonic-stack+1 |
| 1871 | Jump Game VII | Medium | 1896 | stringdynamic-programmingsliding-window+1 |
| 1882 | Process Tasks Using Servers | Medium | 1979 | arrayheap-priority-queue |
| 1888 | Minimum Number of Flips to Make the Binary String Alternating | Medium | 2006 | stringdynamic-programmingsliding-window |
| 1898 | Maximum Number of Removable Characters | Medium | 1913 | arraytwo-pointersstring+1 |
| 1899 | Merge Triplets to Form Target Triplet | Medium | 1635 | arraygreedy |
| 1905 | Count Sub Islands | Medium | 1679 | arraydepth-first-searchbreadth-first-search+2 |
| 1921 | Eliminate Maximum Number of Monsters | Medium | 1528 | arraygreedysorting |
| 1926 | Nearest Exit from Entrance in Maze | Medium | 1638 | bfsarraymatrix |
| 1930 | Unique Length-3 Palindromic Subsequences | Medium | 1533 | hash-tablestringbit-manipulation+1 |
| 1958 | Check if Move is Legal | Medium | 1659 | arraymatrixenumeration |
| 1963 | Minimum Number of Swaps to Make the String Balanced | Medium | 1689 | two-pointersstringstack+1 |
| 1968 | Array With Elements Not Equal to Average of Neighbors | Medium | 1499 | arraygreedysorting |
| 1976 | Number of Ways to Arrive at Destination | Medium | 2095 | dynamic-programminggraphtopological-sort+1 |
| 1980 | Find Unique Binary String | Medium | 1362 | arrayhash-tablestring+1 |
| 1985 | Find the Kth Largest Integer in the Array | Medium | 1414 | arraystringdivide-and-conquer+3 |
| 1993 | Operations on Tree | Medium | 1861 | arrayhash-tabletree+3 |
| 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 |
| 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 |
| 2048 | Next Greater Numerically Balanced Number | Medium | 1734 | hash-tablemathbacktracking+2 |
| 2069 | Walking Robot Simulation II | Medium | 1919 | designsimulation |
| 2080 | Range Frequency Queries | Medium | 1702 | arrayhash-tablebinary-search+2 |