| 1482 | Minimum Number of Days to Make m Bouquets | Medium |
| 1483 | Kth Ancestor of a Tree Node | Hard |
| 1488 | Avoid Flood in The City | Medium |
| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | Medium |
| 1508 | Range Sum of Sorted Subarray Sums | Medium |
| 1521 | Find a Value of a Mysterious Function Closest to Target | Hard |
| 1539 | Kth Missing Positive Number | Easy |
| 1552 | Magnetic Force Between Two Balls | Medium |
| 1562 | Find Latest Group of Size M | Medium |
| 1574 | Shortest Subarray to be Removed to Make Array Sorted | Medium |
| 1608 | Special Array With X Elements Greater Than or Equal X | Easy |
| 1631 | Path With Minimum Effort | Medium |
| 1648 | Sell Diminishing-Valued Colored Balls | Medium |
| 1649 | Create Sorted Array through Instructions | Hard |
| 1658 | Minimum Operations to Reduce X to Zero | Medium |
| 1671 | Minimum Number of Removals to Make Mountain Array | Hard |
| 1712 | Ways to Split Array Into Three Subarrays | Medium |
| 1713 | Minimum Operations to Make a Subsequence | Hard |
| 1739 | Building Boxes | Hard |
| 1751 | Maximum Number of Events That Can Be Attended II | Hard |
| 1760 | Minimum Limit of Balls in a Bag | Medium |
| 1782 | Count Pairs Of Nodes | Hard |
| 1793 | Maximum Score of a Good Subarray | Hard |
| 1802 | Maximum Value at a Given Index in a Bounded Array | Medium |
| 1818 | Minimum Absolute Sum Difference | Medium |
| 1838 | Frequency of the Most Frequent Element | Medium |
| 1847 | Closest Room | Hard |
| 1851 | Minimum Interval to Include Each Query | Hard |
| 1855 | Maximum Distance Between a Pair of Values | Medium |
| 1862 | Sum of Floored Pairs | Hard |