| 924 | Minimize Malware Spread | ArrayHash TableDepth-First Search+3 | Hard |
| 927 | Three Equal Parts | ArrayMath | Hard |
| 928 | Minimize Malware Spread II | ArrayHash TableDepth-First Search+3 | Hard |
| 936 | Stamping The Sequence | StringStackGreedy+1 | Hard |
| 940 | Distinct Subsequences II | StringDynamic Programming | Hard |
| 943 | Find the Shortest Superstring | ArrayStringDynamic Programming+2 | Hard |
| 952 | Largest Component Size by Common Factor | ArrayHash TableMath+2 | Hard |
| 956 | Tallest Billboard | ArrayDynamic Programming | Hard |
| 960 | Delete Columns to Make Sorted III | ArrayStringDynamic Programming | Hard |
| 964 | Least Operators to Express Number | MathDynamic ProgrammingMemoization | Hard |
| 968 | Binary Tree Cameras | Dynamic ProgrammingTreeDepth-First Search+1 | Hard |
| 972 | Equal Rational Numbers | MathString | Hard |
| 975 | Odd Even Jump | ArrayDynamic ProgrammingStack+3 | Hard |
| 980 | Unique Paths III | ArrayBacktrackingBit Manipulation+1 | Hard |
| 982 | Triples with Bitwise AND Equal To Zero | ArrayHash TableBit Manipulation | Hard |
| 987 | Vertical Order Traversal of a Binary Tree | Hash TableTreeDepth-First Search+3 | Hard |
| 992 | Subarrays with K Different Integers | ArrayHash TableSliding Window+1 | Hard |
| 995 | Minimum Number of K Consecutive Bit Flips | ArrayBit ManipulationQueue+2 | Hard |
| 996 | Number of Squareful Arrays | ArrayHash TableMath+4 | Hard |
| 1000 | Minimum Cost to Merge Stones | ArrayDynamic ProgrammingPrefix Sum | Hard |
| 1001 | Grid Illumination | ArrayHash Table | Hard |
| 1012 | Numbers With Repeated Digits | MathDynamic Programming | Hard |
| 1028 | Recover a Tree From Preorder Traversal | StringTreeDepth-First Search+1 | Hard |
| 1032 | Stream of Characters | ArrayStringDesign+2 | Hard |
| 1036 | Escape a Large Maze | ArrayHash TableDepth-First Search+1 | Hard |
| 1044 | Longest Duplicate Substring | StringBinary SearchSliding Window+3 | Hard |
| 1074 | Number of Submatrices That Sum to Target | ArrayHash TableMatrix+1 | Hard |
| 1092 | Shortest Common Supersequence | StringDynamic Programming | Hard |
| 1095 | Find in Mountain Array | ArrayBinary SearchInteractive | Hard |
| 1096 | Brace Expansion II | StringBacktrackingStack+1 | Hard |
| 1106 | Parsing A Boolean Expression | StringStackRecursion | Hard |
| 1125 | Smallest Sufficient Team | ArrayDynamic ProgrammingBit Manipulation+1 | Hard |
| 1147 | Longest Chunked Palindrome Decomposition | Two PointersStringDynamic Programming+3 | Hard |
| 1157 | Online Majority Element In Subarray | ArrayBinary SearchDesign+2 | Hard |
| 1163 | Last Substring in Lexicographical Order | Two PointersString | Hard |
| 1172 | Dinner Plate Stacks | Hash TableStackDesign+1 | Hard |
| 1178 | Number of Valid Words for Each Puzzle | ArrayHash TableString+2 | Hard |
| 1187 | Make Array Strictly Increasing | ArrayBinary SearchDynamic Programming+1 | Hard |
| 1192 | Critical Connections in a Network | Depth-First SearchGraphBiconnected Component | Hard |
| 1203 | Sort Items by Groups Respecting Dependencies | Depth-First SearchBreadth-First SearchGraph+1 | Hard |
| 1206 | Design Skiplist | Linked ListDesign | Hard |
| 1210 | Minimum Moves to Reach Target with Rotations | ArrayBreadth-First SearchMatrix | Hard |
| 1220 | Count Vowels Permutation | Dynamic Programming | Hard |
| 1223 | Dice Roll Simulation | ArrayDynamic Programming | Hard |
| 1224 | Maximum Equal Frequency | ArrayHash Table | Hard |
| 1235 | Maximum Profit in Job Scheduling | ArrayBinary SearchDynamic Programming+1 | Hard |
| 1240 | Tiling a Rectangle with the Fewest Squares | Backtracking | Hard |
| 1250 | Check If It Is a Good Array | ArrayMathNumber Theory | Hard |
| 1255 | Maximum Score Words Formed by Letters | ArrayStringDynamic Programming+3 | Hard |
| 1263 | Minimum Moves to Move a Box to Their Target Location | ArrayBreadth-First SearchHeap (Priority Queue)+1 | Hard |