| 759 | Employee Free Time | Hard | 1712 | arraysortingheap-priority-queue |
| 762 | Prime Number of Set Bits in Binary Representations | Easy | 1262 | mathbit-manipulation |
| 763 | Partition Labels | Medium | 1464 | hash-tabletwo-pointersstring+1 |
| 765 | Couples Holding Hands | Hard | 1999 | greedydepth-first-searchbreadth-first-search+2 |
| 767 | Reorganize String | Medium | 1681 | hash-tablestringgreedy+3 |
| 778 | Swim in Rising Water | Hard | 2097 | arraybinary-searchdepth-first-search+4 |
| 783 | Minimum Distance Between BST Nodes | Easy | 1303 | treedepth-first-searchbreadth-first-search+2 |
| 785 | Is Graph Bipartite? | Medium | 1625 | depth-first-searchbreadth-first-searchunion-find+1 |
| 786 | K-th Smallest Prime Fraction | Medium | 1818 | arraytwo-pointersbinary-search+2 |
| 787 | Cheapest Flights Within K Stops | Medium | 1786 | dynamic-programmingdepth-first-searchbreadth-first-search+3 |
| 790 | Domino and Tromino Tiling | Medium | 1796 | dynamic-programmingmath |
| 795 | Number of Subarrays with Bounded Maximum | Medium | 1817 | arraytwo-pointersprefix-sum |
| 797 | All Paths From Source to Target | Medium | 1383 | backtrackingdepth-first-searchbreadth-first-search+1 |
| 802 | Find Eventual Safe States | Medium | 1962 | depth-first-searchbreadth-first-searchgraph+1 |
| 820 | Short Encoding of Words | Medium | 1623 | arrayhash-tablestring+1 |
| 827 | Making A Large Island | Hard | 2151 | arraydepth-first-searchbreadth-first-search+2 |
| 837 | New 21 Game | Medium | 2350 | mathdynamic-programmingsliding-window+1 |
| 838 | Push Dominoes | Medium | 1638 | two-pointersstringdynamic-programming |
| 839 | Similar String Groups | Hard | 1861 | arraystringdepth-first-search+2 |
| 841 | Keys and Rooms | Medium | 1412 | depth-first-searchbreadth-first-searchgraph |
| 843 | Guess the Word | Hard | 1985 | arraymathstring+2 |
| 846 | Hand of Straights | Medium | 1604 | arrayhash-tablegreedy+1 |
| 850 | Rectangle Area II | Hard | 2236 | arraysegment-treeline-sweep+1 |
| 851 | Loud and Rich | Medium | 1783 | arraydepth-first-searchgraph+1 |
| 852 | Peak Index in a Mountain Array | Medium | 1176 | arraybinary-search |
| 853 | Car Fleet | Medium | 1740 | arraymathstack+2 |
| 855 | Exam Room | Medium | 2067 | designheap-priority-queueordered-set |
| 858 | Mirror Reflection | Medium | 1881 | mathgeometrynumber-theory |
| 860 | Lemonade Change | Easy | 1186 | arraygreedy |
| 862 | Shortest Subarray with Sum at Least K | Hard | 2307 | arraybinary-searchqueue+4 |
| 872 | Leaf-Similar Trees | Easy | 1307 | treedfsrecursion |
| 875 | Koko Eating Bananas | Medium | 1765 | arraybinary-search |
| 876 | Middle of the Linked List | Easy | 1168 | linked-listtwo-pointers |
| 877 | Stone Game | Medium | 1590 | arraymathdynamic-programming+1 |
| 879 | Profitable Schemes | Hard | 2204 | arraydynamic-programming |
| 881 | Boats to Save People | Medium | 1530 | arraytwo-pointersgreedy+1 |
| 882 | Reachable Nodes In Subdivided Graph | Hard | 2328 | graphheap-priority-queueshortest-path |
| 886 | Possible Bipartition | Medium | 1795 | depth-first-searchbreadth-first-searchunion-find+1 |
| 894 | All Possible Full Binary Trees | Medium | 1784 | dynamic-programmingtreerecursion+2 |
| 895 | Maximum Frequency Stack | Hard | 2028 | hash-tablestackdesign+1 |
| 900 | RLE Iterator | Medium | 1532 | arraydesigncounting+1 |
| 901 | Online Stock Span | Medium | 1708 | stackdesignmonotonic-stack+1 |
| 904 | Fruit Into Baskets | Medium | 1709 | arrayhash-tablesliding-window |
| 907 | Sum of Subarray Minimums | Medium | 1823 | arraydynamic-programmingstack+1 |
| 909 | Snakes and Ladders | Medium | 1962 | arraybreadth-first-searchmatrix |
| 912 | Sort an Array | Medium | — | arraydivide-and-conquersorting+5 |
| 913 | Cat and Mouse | Hard | 2567 | mathdynamic-programminggraph+3 |
| 914 | X of a Kind in a Deck of Cards | Easy | 1371 | arrayhash-tablemath+2 |
| 918 | Maximum Sum Circular Subarray | Medium | 1777 | arraydivide-and-conquerdynamic-programming+2 |
| 920 | Number of Music Playlists | Hard | 2400 | mathdynamic-programmingcombinatorics |