| 1302 | Deepest Leaves Sum | TreeDepth-First SearchBreadth-First Search+1 | Medium |
| 1304 | Find N Unique Integers Sum up to Zero | ArrayMath | Easy |
| 1305 | All Elements in Two Binary Search Trees | TreeDepth-First SearchBinary Search Tree+2 | Medium |
| 1306 | Jump Game III | ArrayDepth-First SearchBreadth-First Search | Medium |
| 1307 | Verbal Arithmetic Puzzle | ArrayMathString+1 | Hard |
| 1309 | Decrypt String from Alphabet to Integer Mapping | String | Easy |
| 1310 | XOR Queries of a Subarray | ArrayBit ManipulationPrefix Sum | Medium |
| 1311 | Get Watched Videos by Your Friends | ArrayHash TableBreadth-First Search+2 | Medium |
| 1312 | Minimum Insertion Steps to Make a String Palindrome | StringDynamic Programming | Hard |
| 1313 | Decompress Run-Length Encoded List | Array | Easy |
| 1314 | Matrix Block Sum | ArrayMatrixPrefix Sum | Medium |
| 1315 | Sum of Nodes with Even-Valued Grandparent | TreeDepth-First SearchBreadth-First Search+1 | Medium |
| 1316 | Distinct Echo Substrings | StringTrieRolling Hash+1 | Hard |
| 1317 | Convert Integer to the Sum of Two No-Zero Integers | Math | Easy |
| 1318 | Minimum Flips to Make a OR b Equal to c | Bit Manipulation | Medium |
| 1319 | Number of Operations to Make Network Connected | Depth-First SearchBreadth-First SearchUnion Find+1 | Medium |
| 1320 | Minimum Distance to Type a Word Using Two Fingers | StringDynamic Programming | Hard |
| 1321 | Restaurant Growth | Database | Medium |
| 1323 | Maximum 69 Number | MathGreedy | Easy |
| 1324 | Print Words Vertically | ArrayStringSimulation | Medium |
| 1325 | Delete Leaves With a Given Value | TreeDepth-First SearchBinary Tree | Medium |
| 1326 | Minimum Number of Taps to Open to Water a Garden | ArrayDynamic ProgrammingGreedy | Hard |
| 1327 | List the Products Ordered in a Period | Database | Easy |
| 1328 | Break a Palindrome | StringGreedy | Medium |
| 1329 | Sort the Matrix Diagonally | ArraySortingMatrix | Medium |
| 1330 | Reverse Subarray To Maximize Array Value | ArrayMathGreedy | Hard |
| 1331 | Rank Transform of an Array | ArrayHash TableSorting | Easy |
| 1332 | Remove Palindromic Subsequences | Two PointersString | Easy |
| 1333 | Filter Restaurants by Vegan-Friendly, Price and Distance | ArraySorting | Medium |
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Dynamic ProgrammingGraphShortest Path | Medium |
| 1335 | Minimum Difficulty of a Job Schedule | ArrayDynamic Programming | Hard |
| 1337 | The K Weakest Rows in a Matrix | ArrayBinary SearchSorting+2 | Easy |
| 1338 | Reduce Array Size to The Half | ArrayHash TableGreedy+2 | Medium |
| 1339 | Maximum Product of Splitted Binary Tree | TreeDepth-First SearchBinary Tree | Medium |
| 1340 | Jump Game V | ArrayDynamic ProgrammingSorting | Hard |
| 1341 | Movie Rating | Database | Medium |
| 1342 | Number of Steps to Reduce a Number to Zero | MathBit Manipulation | Easy |
| 1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | ArraySliding Window | Medium |
| 1344 | Angle Between Hands of a Clock | Math | Medium |
| 1345 | Jump Game IV | ArrayHash TableBreadth-First Search | Hard |
| 1346 | Check If N and Its Double Exist | ArrayHash TableTwo Pointers+2 | Easy |
| 1347 | Minimum Number of Steps to Make Two Strings Anagram | Hash TableStringCounting | Medium |
| 1348 | Tweet Counts Per Frequency | Hash TableBinary SearchDesign+2 | Medium |
| 1349 | Maximum Students Taking Exam | ArrayDynamic ProgrammingBit Manipulation+2 | Hard |
| 1351 | Count Negative Numbers in a Sorted Matrix | ArrayBinary SearchMatrix | Easy |
| 1352 | Product of the Last K Numbers | ArrayMathDesign+2 | Medium |
| 1353 | Maximum Number of Events That Can Be Attended | ArrayGreedySorting+1 | Medium |
| 1354 | Construct Target Array With Multiple Sums | ArrayHeap (Priority Queue) | Hard |
| 1356 | Sort Integers by The Number of 1 Bits | ArrayBit ManipulationSorting+1 | Easy |
| 1357 | Apply Discount Every n Orders | ArrayHash TableDesign | Medium |