| 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 |
| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | ArrayDynamic ProgrammingStack+2 | Hard |
| 1531 | String Compression II | StringDynamic Programming | Hard |
| 1537 | Get the Maximum Score | ArrayTwo PointersDynamic Programming+1 | Hard |
| 1542 | Find Longest Awesome Substring | Hash TableStringBit Manipulation | Hard |
| 1547 | Minimum Cost to Cut a Stick | ArrayDynamic ProgrammingSorting | Hard |
| 1553 | Minimum Number of Days to Eat N Oranges | Dynamic ProgrammingMemoization | Hard |
| 1563 | Stone Game V | ArrayMathDynamic Programming+1 | Hard |
| 1568 | Minimum Number of Days to Disconnect Island | ArrayDepth-First SearchBreadth-First Search+2 | Hard |
| 1569 | Number of Ways to Reorder Array to Get Same BST | ArrayMathDivide and Conquer+7 | Hard |
| 1575 | Count All Possible Routes | ArrayDynamic ProgrammingMemoization | Hard |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Union FindGraph | Hard |
| 1585 | Check If String Is Transformable With Substring Sort Operations | StringGreedySorting | Hard |
| 1591 | Strange Printer II | ArrayGraphTopological Sort+1 | Hard |
| 1595 | Minimum Cost to Connect Two Groups of Points | ArrayDynamic ProgrammingBit Manipulation+2 | Hard |
| 1601 | Maximum Number of Achievable Transfer Requests | ArrayBacktrackingBit Manipulation+1 | Hard |
| 1606 | Find Servers That Handled Most Number of Requests | ArrayGreedyHeap (Priority Queue)+1 | Hard |
| 1610 | Maximum Number of Visible Points | ArrayMathGeometry+2 | Hard |
| 1611 | Minimum One Bit Operations to Make Integers Zero | Dynamic ProgrammingBit ManipulationMemoization | Hard |
| 1617 | Count Subtrees With Max Distance Between Cities | Dynamic ProgrammingBit ManipulationTree+2 | Hard |
| 1622 | Fancy Sequence | MathDesignSegment Tree | Hard |
| 1627 | Graph Connectivity With Threshold | ArrayMathUnion Find+1 | Hard |
| 1632 | Rank Transform of a Matrix | ArrayUnion FindGraph+3 | Hard |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | ArrayStringDynamic Programming | Hard |
| 1643 | Kth Smallest Instructions | ArrayMathDynamic Programming+1 | Hard |
| 1649 | Create Sorted Array through Instructions | ArrayBinary SearchDivide and Conquer+4 | Hard |
| 1655 | Distribute Repeating Integers | ArrayDynamic ProgrammingBacktracking+2 | Hard |
| 1659 | Maximize Grid Happiness | Dynamic ProgrammingBit ManipulationMemoization+1 | Hard |
| 1665 | Minimum Initial Energy to Finish Tasks | ArrayGreedySorting | Hard |
| 1671 | Minimum Number of Removals to Make Mountain Array | ArrayBinary SearchDynamic Programming+1 | Hard |
| 1675 | Minimize Deviation in Array | ArrayGreedyHeap (Priority Queue)+1 | Hard |
| 1681 | Minimum Incompatibility | ArrayDynamic ProgrammingBit Manipulation+1 | Hard |
| 1687 | Delivering Boxes from Storage to Ports | ArrayDynamic ProgrammingSegment Tree+4 | Hard |
| 1691 | Maximum Height by Stacking Cuboids | ArrayDynamic ProgrammingSorting | Hard |
| 1697 | Checking Existence of Edge Length Limited Paths | ArrayTwo PointersUnion Find+2 | Hard |
| 1703 | Minimum Adjacent Swaps for K Consecutive Ones | ArrayGreedySliding Window+1 | Hard |
| 1707 | Maximum XOR With an Element From Array | ArrayBit ManipulationTrie | Hard |
| 1713 | Minimum Operations to Make a Subsequence | ArrayHash TableBinary Search+1 | Hard |
| 1719 | Number Of Ways To Reconstruct A Tree | TreeGraph | Hard |
| 1723 | Find Minimum Time to Finish All Jobs | ArrayDynamic ProgrammingBacktracking+2 | Hard |
| 1728 | Cat and Mouse II | ArrayMathDynamic Programming+5 | Hard |
| 1735 | Count Ways to Make Array With Product | ArrayMathDynamic Programming+2 | Hard |
| 1739 | Building Boxes | MathBinary SearchGreedy | Hard |
| 1745 | Palindrome Partitioning IV | StringDynamic Programming | Hard |
| 1751 | Maximum Number of Events That Can Be Attended II | ArrayBinary SearchDynamic Programming+1 | Hard |
| 1755 | Closest Subsequence Sum | ArrayTwo PointersDynamic Programming+3 | Hard |
| 1761 | Minimum Degree of a Connected Trio in a Graph | GraphEnumeration | Hard |
| 1766 | Tree of Coprimes | ArrayMathTree+2 | Hard |
| 1770 | Maximum Score from Performing Multiplication Operations | ArrayDynamic Programming | Hard |