| 1540 | Can Convert String in K Moves | Hash TableString | Medium |
| 1541 | Minimum Insertions to Balance a Parentheses String | StringStackGreedy | Medium |
| 1542 | Find Longest Awesome Substring | Hash TableStringBit Manipulation | Hard |
| 1544 | Make The String Great | StringStack | Easy |
| 1545 | Find Kth Bit in Nth Binary String | StringRecursionSimulation | Medium |
| 1546 | Maximum Number of Non-Overlapping Subarrays With Sum Equals Target | ArrayHash TableGreedy+1 | Medium |
| 1547 | Minimum Cost to Cut a Stick | ArrayDynamic ProgrammingSorting | Hard |
| 1550 | Three Consecutive Odds | Array | Easy |
| 1551 | Minimum Operations to Make Array Equal | Math | Medium |
| 1552 | Magnetic Force Between Two Balls | ArrayBinary SearchSorting | Medium |
| 1553 | Minimum Number of Days to Eat N Oranges | Dynamic ProgrammingMemoization | Hard |
| 1556 | Thousand Separator | String | Easy |
| 1557 | Minimum Number of Vertices to Reach All Nodes | Graph | Medium |
| 1558 | Minimum Numbers of Function Calls to Make Target Array | ArrayGreedyBit Manipulation | Medium |
| 1559 | Detect Cycles in 2D Grid | ArrayDepth-First SearchBreadth-First Search+2 | Medium |
| 1560 | Most Visited Sector in a Circular Track | ArraySimulation | Easy |
| 1561 | Maximum Number of Coins You Can Get | ArrayMathGreedy+2 | Medium |
| 1562 | Find Latest Group of Size M | ArrayHash TableBinary Search+1 | Medium |
| 1563 | Stone Game V | ArrayMathDynamic Programming+1 | Hard |
| 1566 | Detect Pattern of Length M Repeated K or More Times | ArrayEnumeration | Easy |
| 1567 | Maximum Length of Subarray With Positive Product | ArrayDynamic ProgrammingGreedy | Medium |
| 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 |
| 1572 | Matrix Diagonal Sum | ArrayMatrix | Easy |
| 1573 | Number of Ways to Split a String | MathString | Medium |
| 1574 | Shortest Subarray to be Removed to Make Array Sorted | ArrayTwo PointersBinary Search+2 | Medium |
| 1575 | Count All Possible Routes | ArrayDynamic ProgrammingMemoization | Hard |
| 1576 | Replace All ?'s to Avoid Consecutive Repeating Characters | String | Easy |
| 1577 | Number of Ways Where Square of Number Is Equal to Product of Two Numbers | ArrayHash TableMath+1 | Medium |
| 1578 | Minimum Time to Make Rope Colorful | ArrayStringDynamic Programming+1 | Medium |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Union FindGraph | Hard |
| 1581 | Customer Who Visited but Did Not Make Any Transactions | Database | Easy |
| 1582 | Special Positions in a Binary Matrix | ArrayMatrix | Easy |
| 1583 | Count Unhappy Friends | ArraySimulation | Medium |
| 1584 | Min Cost to Connect All Points | ArrayUnion FindGraph+1 | Medium |
| 1585 | Check If String Is Transformable With Substring Sort Operations | StringGreedySorting | Hard |
| 1587 | Bank Account Summary II | Database | Easy |
| 1588 | Sum of All Odd Length Subarrays | ArrayMathPrefix Sum | Easy |
| 1589 | Maximum Sum Obtained of Any Permutation | ArrayGreedySorting+1 | Medium |
| 1590 | Make Sum Divisible by P | ArrayHash TablePrefix Sum | Medium |
| 1591 | Strange Printer II | ArrayGraphTopological Sort+1 | Hard |
| 1592 | Rearrange Spaces Between Words | String | Easy |
| 1593 | Split a String Into the Max Number of Unique Substrings | Hash TableStringBacktracking | Medium |
| 1594 | Maximum Non Negative Product in a Matrix | ArrayDynamic ProgrammingMatrix | Medium |
| 1595 | Minimum Cost to Connect Two Groups of Points | ArrayDynamic ProgrammingBit Manipulation+2 | Hard |
| 1598 | Crawler Log Folder | ArrayStringStack | Easy |
| 1599 | Maximum Profit of Operating a Centennial Wheel | ArraySimulation | Medium |
| 1600 | Throne Inheritance | Hash TableTreeDepth-First Search+1 | Medium |
| 1601 | Maximum Number of Achievable Transfer Requests | ArrayBacktrackingBit Manipulation+1 | Hard |
| 1603 | Design Parking System | DesignSimulationCounting | Easy |