| 1626 | Best Team With No Conflicts | Medium |
| 1627 | Graph Connectivity With Threshold | Hard |
| 1629 | Slowest Key | Easy |
| 1630 | Arithmetic Subarrays | Medium |
| 1631 | Path With Minimum Effort | Medium |
| 1632 | Rank Transform of a Matrix | Hard |
| 1636 | Sort Array by Increasing Frequency | Easy |
| 1637 | Widest Vertical Area Between Two Points Containing No Points | Medium |
| 1638 | Count Substrings That Differ by One Character | Medium |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | Hard |
| 1640 | Check Array Formation Through Concatenation | Easy |
| 1641 | Count Sorted Vowel Strings | Medium |
| 1642 | Furthest Building You Can Reach | Medium |
| 1643 | Kth Smallest Instructions | Hard |
| 1646 | Get Maximum in Generated Array | Easy |
| 1647 | Minimum Deletions to Make Character Frequencies Unique | Medium |
| 1648 | Sell Diminishing-Valued Colored Balls | Medium |
| 1649 | Create Sorted Array through Instructions | Hard |
| 1652 | Defuse the Bomb | Easy |
| 1653 | Minimum Deletions to Make String Balanced | Medium |
| 1654 | Minimum Jumps to Reach Home | Medium |
| 1655 | Distribute Repeating Integers | Hard |
| 1656 | Design an Ordered Stream | Easy |
| 1657 | Determine if Two Strings Are Close | Medium |
| 1658 | Minimum Operations to Reduce X to Zero | Medium |
| 1659 | Maximize Grid Happiness | Hard |
| 1662 | Check If Two String Arrays are Equivalent | Easy |
| 1663 | Smallest String With A Given Numeric Value | Medium |
| 1664 | Ways to Make a Fair Array | Medium |
| 1665 | Minimum Initial Energy to Finish Tasks | Hard |