| 1591 | Strange Printer II | Hard |
| 1595 | Minimum Cost to Connect Two Groups of Points | Hard |
| 1601 | Maximum Number of Achievable Transfer Requests | Hard |
| 1606 | Find Servers That Handled Most Number of Requests | Hard |
| 1610 | Maximum Number of Visible Points | Hard |
| 1611 | Minimum One Bit Operations to Make Integers Zero | Hard |
| 1617 | Count Subtrees With Max Distance Between Cities | Hard |
| 1622 | Fancy Sequence | Hard |
| 1627 | Graph Connectivity With Threshold | Hard |
| 1632 | Rank Transform of a Matrix | Hard |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | Hard |
| 1643 | Kth Smallest Instructions | Hard |
| 1649 | Create Sorted Array through Instructions | Hard |
| 1655 | Distribute Repeating Integers | Hard |
| 1659 | Maximize Grid Happiness | Hard |
| 1665 | Minimum Initial Energy to Finish Tasks | Hard |
| 1671 | Minimum Number of Removals to Make Mountain Array | Hard |
| 1675 | Minimize Deviation in Array | Hard |
| 1681 | Minimum Incompatibility | Hard |
| 1687 | Delivering Boxes from Storage to Ports | Hard |
| 1691 | Maximum Height by Stacking Cuboids | Hard |
| 1697 | Checking Existence of Edge Length Limited Paths | Hard |
| 1703 | Minimum Adjacent Swaps for K Consecutive Ones | Hard |
| 1707 | Maximum XOR With an Element From Array | Hard |
| 1713 | Minimum Operations to Make a Subsequence | Hard |
| 1719 | Number Of Ways To Reconstruct A Tree | Hard |
| 1723 | Find Minimum Time to Finish All Jobs | Hard |
| 1728 | Cat and Mouse II | Hard |
| 1735 | Count Ways to Make Array With Product | Hard |
| 1739 | Building Boxes | Hard |