| 1137 | N-th Tribonacci Number | Easy | 1228 | dynamic-programmingmathmemoization |
| 1140 | Stone Game II | Medium | 2035 | arraymathdynamic-programming+2 |
| 1143 | Longest Common Subsequence | Medium | 1727 | stringdynamic-programming |
| 1157 | Online Majority Element In Subarray | Hard | 2205 | arraybinary-searchdesign+2 |
| 1161 | Maximum Level Sum of a Binary Tree | Medium | 1388 | treebfsbinary-tree |
| 1162 | As Far from Land as Possible | Medium | 1666 | arraydynamic-programmingbreadth-first-search+1 |
| 1189 | Maximum Number of Balloons | Easy | 1182 | hash-tablestringcounting |
| 1201 | Ugly Number III | Medium | 2039 | mathbinary-searchcombinatorics+1 |
| 1203 | Sort Items by Groups Respecting Dependencies | Hard | 2419 | depth-first-searchbreadth-first-searchgraph+1 |
| 1207 | Unique Number of Occurrences | Easy | 1195 | hash-tablearray |
| 1209 | Remove All Adjacent Duplicates in String II | Medium | 1542 | stringstack |
| 1220 | Count Vowels Permutation | Hard | 1730 | dynamic-programming |
| 1229 | Meeting Scheduler | Medium | 1423 | arraytwo-pointerssorting |
| 1233 | Remove Sub-Folders from the Filesystem | Medium | 1505 | arraystringtrie |
| 1234 | Replace the Substring for Balanced String | Medium | 1878 | stringsliding-windowtwo-pointers |
| 1235 | Maximum Profit in Job Scheduling | Hard | 2008 | arraybinary-searchdynamic-programming+1 |
| 1239 | Maximum Length of a Concatenated String with Unique Characters | Medium | 1791 | arraystringbacktracking+1 |
| 1249 | Minimum Remove to Make Valid Parentheses | Medium | 1657 | stringstack |
| 1254 | Number of Closed Islands | Medium | 1659 | arraydepth-first-searchbreadth-first-search+2 |
| 1255 | Maximum Score Words Formed by Letters | Hard | 1882 | arrayhash-tablestring+5 |
| 1260 | Shift 2D Grid | Easy | 1337 | arraymatrixsimulation |
| 1267 | Count Servers that Communicate | Medium | 1375 | arraydepth-first-searchbreadth-first-search+3 |
| 1268 | Search Suggestions System | Medium | 1573 | stringtriebinary-search+1 |
| 1272 | Remove Interval | Medium | 1535 | array |
| 1283 | Find the Smallest Divisor Given a Threshold | Medium | 1541 | arraybinary-search |
| 1286 | Iterator for Combination | Medium | 1591 | stringbacktrackingdesign+1 |
| 1288 | Remove Covered Intervals | Medium | 1375 | arraygreedysorting |
| 1299 | Replace Elements with Greatest Element on Right Side | Easy | 1219 | array |
| 1305 | All Elements in Two Binary Search Trees | Medium | 1260 | treedepth-first-searchbinary-search-tree+2 |
| 1318 | Minimum Flips to Make a OR b Equal to c | Medium | 1476 | bit-manipulationmath |
| 1319 | Number of Operations to Make Network Connected | Medium | 1633 | depth-first-searchbreadth-first-searchunion-find+1 |
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | 1855 | dynamic-programminggraphshortest-path |
| 1343 | Number of Sub-arrays of Size K and Average Greater Than or Equal to Threshold | Medium | 1317 | arraysliding-window |
| 1348 | Tweet Counts Per Frequency | Medium | 2037 | hash-tablestringbinary-search+3 |
| 1352 | Product of the Last K Numbers | Medium | 1474 | arraymathdesign+2 |
| 1353 | Maximum Number of Events That Can Be Attended | Medium | 1786 | arraygreedysorting+1 |
| 1356 | Sort Integers by The Number of 1 Bits | Easy | 1175 | bit-manipulationsorting |
| 1359 | Count All Valid Pickup and Delivery Options | Hard | 1723 | mathdynamic-programmingcombinatorics |
| 1361 | Validate Binary Tree Nodes | Medium | 1465 | treedepth-first-searchbreadth-first-search+3 |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 2069 | arraybreadth-first-searchgraph+3 |
| 1372 | Longest ZigZag Path in a Binary Tree | Medium | 1713 | dynamic-programmingtreedepth-first-search+1 |
| 1376 | Time Needed to Inform All Employees | Medium | 1561 | treedepth-first-searchbreadth-first-search |
| 1382 | Balance a Binary Search Tree | Medium | 1541 | divide-and-conquergreedytree+3 |
| 1383 | Maximum Performance of a Team | Hard | 2091 | arraygreedysorting+1 |
| 1395 | Count Number of Teams | Medium | 1344 | arraydynamic-programmingbinary-indexed-tree+1 |
| 1396 | Design Underground System | Medium | 1465 | hash-tablestringdesign |
| 1405 | Longest Happy String | Medium | 1821 | stringgreedyheap-priority-queue |
| 1406 | Stone Game III | Hard | 2027 | arraymathdynamic-programming+1 |
| 1409 | Queries on a Permutation With Key | Medium | 1335 | arraybinary-indexed-treesimulation |
| 1423 | Maximum Points You Can Obtain from Cards | Medium | 1574 | arraysliding-windowprefix-sum |