| 1604 | Alert Using Same Key-Card Three or More Times in a One Hour Period | ArrayHash TableString+1 | Medium |
| 1605 | Find Valid Matrix Given Row and Column Sums | ArrayGreedyMatrix | Medium |
| 1606 | Find Servers That Handled Most Number of Requests | ArrayGreedyHeap (Priority Queue)+1 | Hard |
| 1608 | Special Array With X Elements Greater Than or Equal X | ArrayBinary SearchSorting | Easy |
| 1609 | Even Odd Tree | TreeBreadth-First SearchBinary Tree | Medium |
| 1610 | Maximum Number of Visible Points | ArrayMathGeometry+2 | Hard |
| 1611 | Minimum One Bit Operations to Make Integers Zero | Dynamic ProgrammingBit ManipulationMemoization | Hard |
| 1614 | Maximum Nesting Depth of the Parentheses | StringStack | Easy |
| 1615 | Maximal Network Rank | Graph | Medium |
| 1616 | Split Two Strings to Make Palindrome | Two PointersString | Medium |
| 1617 | Count Subtrees With Max Distance Between Cities | Dynamic ProgrammingBit ManipulationTree+2 | Hard |
| 1619 | Mean of Array After Removing Some Elements | ArraySorting | Easy |
| 1620 | Coordinate With Maximum Network Quality | ArrayEnumeration | Medium |
| 1621 | Number of Sets of K Non-Overlapping Line Segments | MathDynamic ProgrammingCombinatorics | Medium |
| 1622 | Fancy Sequence | MathDesignSegment Tree | Hard |
| 1624 | Largest Substring Between Two Equal Characters | Hash TableString | Easy |
| 1625 | Lexicographically Smallest String After Applying Operations | StringDepth-First SearchBreadth-First Search+1 | Medium |
| 1626 | Best Team With No Conflicts | ArrayDynamic ProgrammingSorting | Medium |
| 1627 | Graph Connectivity With Threshold | ArrayMathUnion Find+1 | Hard |
| 1629 | Slowest Key | ArrayString | Easy |
| 1630 | Arithmetic Subarrays | ArrayHash TableSorting | Medium |
| 1631 | Path With Minimum Effort | ArrayBinary SearchDepth-First Search+4 | Medium |
| 1632 | Rank Transform of a Matrix | ArrayUnion FindGraph+3 | Hard |
| 1633 | Percentage of Users Attended a Contest | Database | Easy |
| 1636 | Sort Array by Increasing Frequency | ArrayHash TableSorting | Easy |
| 1637 | Widest Vertical Area Between Two Points Containing No Points | ArraySorting | Easy |
| 1638 | Count Substrings That Differ by One Character | Hash TableStringDynamic Programming+1 | Medium |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | ArrayStringDynamic Programming | Hard |
| 1640 | Check Array Formation Through Concatenation | ArrayHash Table | Easy |
| 1641 | Count Sorted Vowel Strings | MathDynamic ProgrammingCombinatorics | Medium |
| 1642 | Furthest Building You Can Reach | ArrayGreedyHeap (Priority Queue) | Medium |
| 1643 | Kth Smallest Instructions | ArrayMathDynamic Programming+1 | Hard |
| 1646 | Get Maximum in Generated Array | ArraySimulation | Easy |
| 1647 | Minimum Deletions to Make Character Frequencies Unique | Hash TableStringGreedy+1 | Medium |
| 1648 | Sell Diminishing-Valued Colored Balls | ArrayMathBinary Search+3 | Medium |
| 1649 | Create Sorted Array through Instructions | ArrayBinary SearchDivide and Conquer+4 | Hard |
| 1652 | Defuse the Bomb | ArraySliding Window | Easy |
| 1653 | Minimum Deletions to Make String Balanced | StringDynamic ProgrammingStack | Medium |
| 1654 | Minimum Jumps to Reach Home | ArrayDynamic ProgrammingBreadth-First Search | Medium |
| 1655 | Distribute Repeating Integers | ArrayDynamic ProgrammingBacktracking+2 | Hard |
| 1656 | Design an Ordered Stream | ArrayHash TableDesign+1 | Easy |
| 1657 | Determine if Two Strings Are Close | Hash TableStringSorting+1 | Medium |
| 1658 | Minimum Operations to Reduce X to Zero | ArrayHash TableBinary Search+2 | Medium |
| 1659 | Maximize Grid Happiness | Dynamic ProgrammingBit ManipulationMemoization+1 | Hard |
| 1661 | Average Time of Process per Machine | Database | Easy |
| 1662 | Check If Two String Arrays are Equivalent | ArrayString | Easy |
| 1663 | Smallest String With A Given Numeric Value | StringGreedy | Medium |
| 1664 | Ways to Make a Fair Array | ArrayPrefix Sum | Medium |
| 1665 | Minimum Initial Energy to Finish Tasks | ArrayGreedySorting | Hard |
| 1667 | Fix Names in a Table | Database | Easy |