| 1477 | Find Two Non-overlapping Sub-arrays Each With Target Sum | ArrayHash TableBinary Search+2 | Medium |
| 1478 | Allocate Mailboxes | ArrayMathDynamic Programming+1 | Hard |
| 1480 | Running Sum of 1d Array | ArrayPrefix Sum | Easy |
| 1481 | Least Number of Unique Integers after K Removals | ArrayHash TableGreedy+2 | Medium |
| 1482 | Minimum Number of Days to Make m Bouquets | ArrayBinary Search | Medium |
| 1483 | Kth Ancestor of a Tree Node | Binary SearchDynamic ProgrammingTree+3 | Hard |
| 1484 | Group Sold Products By The Date | Database | Easy |
| 1486 | XOR Operation in an Array | MathBit Manipulation | Easy |
| 1487 | Making File Names Unique | ArrayHash TableString | Medium |
| 1488 | Avoid Flood in The City | ArrayHash TableBinary Search+2 | Medium |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Union FindGraphSorting+2 | Hard |
| 1491 | Average Salary Excluding the Minimum and Maximum Salary | ArraySorting | Easy |
| 1492 | The kth Factor of n | MathNumber Theory | Medium |
| 1493 | Longest Subarray of 1's After Deleting One Element | ArrayDynamic ProgrammingSliding Window | Medium |
| 1494 | Parallel Courses II | Dynamic ProgrammingBit ManipulationGraph+1 | Hard |
| 1496 | Path Crossing | Hash TableString | Easy |
| 1497 | Check If Array Pairs Are Divisible by k | ArrayHash TableCounting | Medium |
| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | ArrayTwo PointersBinary Search+1 | Medium |
| 1499 | Max Value of Equation | ArrayQueueSliding Window+2 | Hard |
| 1502 | Can Make Arithmetic Progression From Sequence | ArraySorting | Easy |
| 1503 | Last Moment Before All Ants Fall Out of a Plank | ArrayBrainteaserSimulation | Medium |
| 1504 | Count Submatrices With All Ones | ArrayDynamic ProgrammingStack+2 | Medium |
| 1505 | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | StringGreedyBinary Indexed Tree+1 | Hard |
| 1507 | Reformat Date | String | Easy |
| 1508 | Range Sum of Sorted Subarray Sums | ArrayTwo PointersBinary Search+2 | Medium |
| 1509 | Minimum Difference Between Largest and Smallest Value in Three Moves | ArrayGreedySorting | Medium |
| 1510 | Stone Game IV | MathDynamic ProgrammingGame Theory | Hard |
| 1512 | Number of Good Pairs | ArrayHash TableMath+1 | Easy |
| 1513 | Number of Substrings With Only 1s | MathString | Medium |
| 1514 | Path with Maximum Probability | ArrayGraphHeap (Priority Queue)+1 | Medium |
| 1515 | Best Position for a Service Centre | ArrayMathGeometry+1 | Hard |
| 1517 | Find Users With Valid E-Mails | Database | Easy |
| 1518 | Water Bottles | MathSimulation | Easy |
| 1519 | Number of Nodes in the Sub-Tree With the Same Label | Hash TableTreeDepth-First Search+2 | Medium |
| 1520 | Maximum Number of Non-Overlapping Substrings | StringGreedy | Hard |
| 1521 | Find a Value of a Mysterious Function Closest to Target | ArrayBinary SearchBit Manipulation+1 | Hard |
| 1523 | Count Odd Numbers in an Interval Range | Math | Easy |
| 1524 | Number of Sub-arrays With Odd Sum | ArrayMathDynamic Programming+1 | Medium |
| 1525 | Number of Good Ways to Split a String | Hash TableStringDynamic Programming+1 | Medium |
| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | ArrayDynamic ProgrammingStack+2 | Hard |
| 1527 | Patients With a Condition | Database | Easy |
| 1528 | Shuffle String | ArrayString | Easy |
| 1529 | Minimum Suffix Flips | StringGreedy | Medium |
| 1530 | Number of Good Leaf Nodes Pairs | TreeDepth-First SearchBinary Tree | Medium |
| 1531 | String Compression II | StringDynamic Programming | Hard |
| 1534 | Count Good Triplets | ArrayEnumeration | Easy |
| 1535 | Find the Winner of an Array Game | ArraySimulation | Medium |
| 1536 | Minimum Swaps to Arrange a Binary Grid | ArrayGreedyMatrix | Medium |
| 1537 | Get the Maximum Score | ArrayTwo PointersDynamic Programming+1 | Hard |
| 1539 | Kth Missing Positive Number | ArrayBinary Search | Easy |