| 921 | Minimum Add to Make Parentheses Valid | Medium | 1248 | stringstackgreedy |
| 924 | Minimize Malware Spread | Hard | 1869 | arrayhash-tabledepth-first-search+3 |
| 926 | Flip String to Monotone Increasing | Medium | 1602 | stringdynamic-programming |
| 928 | Minimize Malware Spread II | Hard | 1985 | arrayhash-tabledepth-first-search+3 |
| 929 | Unique Email Addresses | Easy | 1199 | arrayhash-tablestring |
| 930 | Binary Subarrays With Sum | Medium | 1592 | arrayhash-tablesliding-window+1 |
| 933 | Number of Recent Calls | Easy | 1337 | queuedata-stream |
| 934 | Shortest Bridge | Medium | 1826 | arraydepth-first-searchbreadth-first-search+1 |
| 946 | Validate Stack Sequences | Medium | 1462 | arraystacksimulation |
| 947 | Most Stones Removed with Same Row or Column | Medium | 1899 | hash-tabledepth-first-searchunion-find+1 |
| 950 | Reveal Cards In Increasing Order | Medium | 1686 | arrayqueuesorting+1 |
| 951 | Flip Equivalent Binary Trees | Medium | 1477 | treedepth-first-searchbinary-tree |
| 952 | Largest Component Size by Common Factor | Hard | 2272 | arrayhash-tablemath+2 |
| 953 | Verifying an Alien Dictionary | Easy | 1300 | arrayhash-tablestring |
| 958 | Check Completeness of a Binary Tree | Medium | 1703 | treebreadth-first-searchbinary-tree |
| 973 | K Closest Points to Origin | Medium | 1470 | arraymathdivide-and-conquer+4 |
| 974 | Subarray Sums Divisible by K | Medium | 1592 | arrayhash-tableprefix-sum |
| 975 | Odd Even Jump | Hard | 2079 | arraydynamic-programmingstack+3 |
| 977 | Squares of a Sorted Array | Easy | 1130 | arraytwo-pointerssorting |
| 978 | Longest Turbulent Subarray | Medium | 1393 | arraydynamic-programmingsliding-window |
| 980 | Unique Paths III | Hard | 1977 | backtrackingbit-manipulationdynamic-programming |
| 981 | Time Based Key-Value Store | Medium | 1676 | hash-tablestringbinary-search+1 |
| 983 | Minimum Cost For Tickets | Medium | 1786 | arraydynamic-programming |
| 986 | Interval List Intersections | Medium | 1579 | arraytwo-pointers |
| 989 | Add to Array-Form of Integer | Easy | 1235 | arraymath |
| 990 | Satisfiability of Equality Equations | Medium | 1638 | arraystringunion-find+1 |
| 992 | Subarrays with K Different Integers | Hard | 2200 | arrayhash-tablesliding-window+2 |
| 994 | Rotting Oranges | Medium | 1571 | arraybreadth-first-searchmatrix |
| 1004 | Max Consecutive Ones III | Medium | 1655 | arraybinary-searchsliding-window+1 |
| 1008 | Construct Binary Search Tree from Preorder Traversal | Medium | 1563 | arraystacktree+3 |
| 1011 | Capacity To Ship Packages Within D Days | Medium | 1725 | arraybinary-search |
| 1013 | Partition Array Into Three Parts With Equal Sum | Easy | 1248 | arraygreedyprefix-sum |
| 1019 | Next Greater Node In Linked List | Medium | 1546 | arraylinked-liststack+1 |
| 1020 | Number of Enclaves | Medium | 1615 | arraydepth-first-searchbreadth-first-search+2 |
| 1023 | Camelcase Matching | Medium | 1537 | arraytwo-pointersstring+2 |
| 1029 | Two City Scheduling | Medium | 1441 | arraygreedysorting |
| 1032 | Stream of Characters | Hard | 1891 | arraystringdesign+2 |
| 1035 | Uncrossed Lines | Medium | 1806 | arraydynamic-programming |
| 1038 | Binary Search Tree to Greater Sum Tree | Medium | 1375 | treedepth-first-searchbinary-search-tree+1 |
| 1041 | Robot Bounded In Circle | Medium | 1521 | mathstringsimulation |
| 1046 | Last Stone Weight | Easy | 1172 | arrayheap-priority-queue |
| 1049 | Last Stone Weight II | Medium | 2092 | arraydynamic-programming |
| 1071 | Greatest Common Divisor of Strings | Easy | 1397 | stringmath |
| 1074 | Number of Submatrices That Sum to Target | Hard | 2074 | arrayhash-tablematrix+1 |
| 1079 | Letter Tile Possibilities | Medium | 1741 | hash-tablestringbacktracking+1 |
| 1091 | Shortest Path in Binary Matrix | Medium | 1655 | arraybreadth-first-searchmatrix |
| 1094 | Car Pooling | Medium | 1441 | arraysortingheap-priority-queue+2 |
| 1101 | The Earliest Moment When Everyone Become Friends | Medium | 1469 | arrayunion-findsorting |
| 1129 | Shortest Path with Alternating Colors | Medium | 1780 | breadth-first-searchgraph |
| 1130 | Minimum Cost Tree From Leaf Values | Medium | 1759 | arraydynamic-programmingstack+2 |