| 1729 | Find Followers Count | Database | Easy |
| 1731 | The Number of Employees Which Report to Each Employee | Database | Easy |
| 1732 | Find the Highest Altitude | ArrayPrefix Sum | Easy |
| 1733 | Minimum Number of People to Teach | ArrayHash TableGreedy | Medium |
| 1734 | Decode XORed Permutation | ArrayBit Manipulation | Medium |
| 1735 | Count Ways to Make Array With Product | ArrayMathDynamic Programming+2 | Hard |
| 1736 | Latest Time by Replacing Hidden Digits | StringGreedy | Easy |
| 1737 | Change Minimum Characters to Satisfy One of Three Conditions | Hash TableStringCounting+1 | Medium |
| 1738 | Find Kth Largest XOR Coordinate Value | ArrayDivide and ConquerBit Manipulation+5 | Medium |
| 1739 | Building Boxes | MathBinary SearchGreedy | Hard |
| 1741 | Find Total Time Spent by Each Employee | Database | Easy |
| 1742 | Maximum Number of Balls in a Box | Hash TableMathCounting | Easy |
| 1743 | Restore the Array From Adjacent Pairs | ArrayHash TableDepth-First Search | Medium |
| 1744 | Can You Eat Your Favorite Candy on Your Favorite Day? | ArrayPrefix Sum | Medium |
| 1745 | Palindrome Partitioning IV | StringDynamic Programming | Hard |
| 1748 | Sum of Unique Elements | ArrayHash TableCounting | Easy |
| 1749 | Maximum Absolute Sum of Any Subarray | ArrayDynamic Programming | Medium |
| 1750 | Minimum Length of String After Deleting Similar Ends | Two PointersString | Medium |
| 1751 | Maximum Number of Events That Can Be Attended II | ArrayBinary SearchDynamic Programming+1 | Hard |
| 1752 | Check if Array Is Sorted and Rotated | Array | Easy |
| 1753 | Maximum Score From Removing Stones | MathGreedyHeap (Priority Queue) | Medium |
| 1754 | Largest Merge Of Two Strings | Two PointersStringGreedy | Medium |
| 1755 | Closest Subsequence Sum | ArrayTwo PointersDynamic Programming+3 | Hard |
| 1757 | Recyclable and Low Fat Products | Database | Easy |
| 1758 | Minimum Changes To Make Alternating Binary String | String | Easy |
| 1759 | Count Number of Homogenous Substrings | MathString | Medium |
| 1760 | Minimum Limit of Balls in a Bag | ArrayBinary Search | Medium |
| 1761 | Minimum Degree of a Connected Trio in a Graph | GraphEnumeration | Hard |
| 1763 | Longest Nice Substring | Hash TableStringDivide and Conquer+2 | Easy |
| 1764 | Form Array by Concatenating Subarrays of Another Array | ArrayTwo PointersGreedy+1 | Medium |
| 1765 | Map of Highest Peak | ArrayBreadth-First SearchMatrix | Medium |
| 1766 | Tree of Coprimes | ArrayMathTree+2 | Hard |
| 1768 | Merge Strings Alternately | Two PointersString | Easy |
| 1769 | Minimum Number of Operations to Move All Balls to Each Box | ArrayStringPrefix Sum | Medium |
| 1770 | Maximum Score from Performing Multiplication Operations | ArrayDynamic Programming | Hard |
| 1771 | Maximize Palindrome Length From Subsequences | StringDynamic Programming | Hard |
| 1773 | Count Items Matching a Rule | ArrayString | Easy |
| 1774 | Closest Dessert Cost | ArrayDynamic ProgrammingBacktracking | Medium |
| 1775 | Equal Sum Arrays With Minimum Number of Operations | ArrayHash TableGreedy+1 | Medium |
| 1776 | Car Fleet II | ArrayMathStack+2 | Hard |
| 1779 | Find Nearest Point That Has the Same X or Y Coordinate | Array | Easy |
| 1780 | Check if Number is a Sum of Powers of Three | Math | Medium |
| 1781 | Sum of Beauty of All Substrings | Hash TableStringCounting | Medium |
| 1782 | Count Pairs Of Nodes | ArrayHash TableTwo Pointers+4 | Hard |
| 1784 | Check if Binary String Has at Most One Segment of Ones | String | Easy |
| 1785 | Minimum Elements to Add to Form a Given Sum | ArrayGreedy | Medium |
| 1786 | Number of Restricted Paths From First to Last Node | Dynamic ProgrammingGraphTopological Sort+2 | Medium |
| 1787 | Make the XOR of All Segments Equal to Zero | ArrayDynamic ProgrammingBit Manipulation | Hard |
| 1789 | Primary Department for Each Employee | Database | Easy |
| 1790 | Check if One String Swap Can Make Strings Equal | Hash TableStringCounting | Easy |