| 1478 | Allocate Mailboxes | Hard |
| 1483 | Kth Ancestor of a Tree Node | Hard |
| 1493 | Longest Subarray of 1's After Deleting One Element | Medium |
| 1494 | Parallel Courses II | Hard |
| 1504 | Count Submatrices With All Ones | Medium |
| 1510 | Stone Game IV | Hard |
| 1524 | Number of Sub-arrays With Odd Sum | Medium |
| 1525 | Number of Good Ways to Split a String | Medium |
| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | Hard |
| 1531 | String Compression II | Hard |
| 1537 | Get the Maximum Score | Hard |
| 1547 | Minimum Cost to Cut a Stick | Hard |
| 1553 | Minimum Number of Days to Eat N Oranges | Hard |
| 1563 | Stone Game V | Hard |
| 1567 | Maximum Length of Subarray With Positive Product | Medium |
| 1569 | Number of Ways to Reorder Array to Get Same BST | Hard |
| 1575 | Count All Possible Routes | Hard |
| 1578 | Minimum Time to Make Rope Colorful | Medium |
| 1594 | Maximum Non Negative Product in a Matrix | Medium |
| 1595 | Minimum Cost to Connect Two Groups of Points | Hard |
| 1611 | Minimum One Bit Operations to Make Integers Zero | Hard |
| 1617 | Count Subtrees With Max Distance Between Cities | Hard |
| 1621 | Number of Sets of K Non-Overlapping Line Segments | Medium |
| 1626 | Best Team With No Conflicts | Medium |
| 1638 | Count Substrings That Differ by One Character | Medium |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | Hard |
| 1641 | Count Sorted Vowel Strings | Medium |
| 1643 | Kth Smallest Instructions | Hard |
| 1646 | Get Maximum in Generated Array | Easy |
| 1653 | Minimum Deletions to Make String Balanced | Medium |