| 1068 | Product Sales Analysis I | Database | Easy |
| 1070 | Product Sales Analysis III | Database | Medium |
| 1071 | Greatest Common Divisor of Strings | MathString | Easy |
| 1072 | Flip Columns For Maximum Number of Equal Rows | ArrayHash TableMatrix | Medium |
| 1073 | Adding Two Negabinary Numbers | ArrayMath | Medium |
| 1074 | Number of Submatrices That Sum to Target | ArrayHash TableMatrix+1 | Hard |
| 1075 | Project Employees I | Database | Easy |
| 1078 | Occurrences After Bigram | String | Easy |
| 1079 | Letter Tile Possibilities | Hash TableStringBacktracking+1 | Medium |
| 1080 | Insufficient Nodes in Root to Leaf Paths | TreeDepth-First SearchBinary Tree | Medium |
| 1081 | Smallest Subsequence of Distinct Characters | StringStackGreedy+1 | Medium |
| 1084 | Sales Analysis III | Database | Easy |
| 1089 | Duplicate Zeros | ArrayTwo Pointers | Easy |
| 1090 | Largest Values From Labels | ArrayHash TableGreedy+2 | Medium |
| 1091 | Shortest Path in Binary Matrix | ArrayBreadth-First SearchMatrix | Medium |
| 1092 | Shortest Common Supersequence | StringDynamic Programming | Hard |
| 1093 | Statistics from a Large Sample | ArrayMathProbability and Statistics | Medium |
| 1094 | Car Pooling | ArraySortingHeap (Priority Queue)+2 | Medium |
| 1095 | Find in Mountain Array | ArrayBinary SearchInteractive | Hard |
| 1096 | Brace Expansion II | StringBacktrackingStack+1 | Hard |
| 1103 | Distribute Candies to People | MathSimulation | Easy |
| 1104 | Path In Zigzag Labelled Binary Tree | MathTreeBinary Tree | Medium |
| 1105 | Filling Bookcase Shelves | ArrayDynamic Programming | Medium |
| 1106 | Parsing A Boolean Expression | StringStackRecursion | Hard |
| 1108 | Defanging an IP Address | String | Easy |
| 1109 | Corporate Flight Bookings | ArrayPrefix Sum | Medium |
| 1110 | Delete Nodes And Return Forest | ArrayHash TableTree+2 | Medium |
| 1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | StringStack | Medium |
| 1114 | Print in Order | Concurrency | Easy |
| 1115 | Print FooBar Alternately | Concurrency | Medium |
| 1116 | Print Zero Even Odd | Concurrency | Medium |
| 1117 | Building H2O | Concurrency | Medium |
| 1122 | Relative Sort Array | ArrayHash TableSorting+1 | Easy |
| 1123 | Lowest Common Ancestor of Deepest Leaves | Hash TableTreeDepth-First Search+2 | Medium |
| 1124 | Longest Well-Performing Interval | ArrayHash TableStack+2 | Medium |
| 1125 | Smallest Sufficient Team | ArrayDynamic ProgrammingBit Manipulation+1 | Hard |
| 1128 | Number of Equivalent Domino Pairs | ArrayHash TableCounting | Easy |
| 1129 | Shortest Path with Alternating Colors | Breadth-First SearchGraph | Medium |
| 1130 | Minimum Cost Tree From Leaf Values | ArrayDynamic ProgrammingStack+2 | Medium |
| 1131 | Maximum of Absolute Value Expression | ArrayMath | Medium |
| 1137 | N-th Tribonacci Number | MathDynamic ProgrammingMemoization | Easy |
| 1138 | Alphabet Board Path | Hash TableString | Medium |
| 1139 | Largest 1-Bordered Square | ArrayDynamic ProgrammingMatrix | Medium |
| 1140 | Stone Game II | ArrayMathDynamic Programming+2 | Medium |
| 1141 | User Activity for the Past 30 Days I | Database | Easy |
| 1143 | Longest Common Subsequence | StringDynamic Programming | Medium |
| 1144 | Decrease Elements To Make Array Zigzag | ArrayGreedy | Medium |
| 1145 | Binary Tree Coloring Game | TreeDepth-First SearchBinary Tree | Medium |
| 1146 | Snapshot Array | ArrayHash TableBinary Search+1 | Medium |
| 1147 | Longest Chunked Palindrome Decomposition | Two PointersStringDynamic Programming+3 | Hard |