2,913 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 1729 | Find Followers Count | Easy |
| 1731 | The Number of Employees Which Report to Each Employee | Easy |
| 1732 | Find the Highest Altitude | Easy |
| 1733 |
Page 29 of 59
| Minimum Number of People to Teach |
| Medium |
| 1734 | Decode XORed Permutation | Medium |
| 1735 | Count Ways to Make Array With Product | Hard |
| 1736 | Latest Time by Replacing Hidden Digits | Easy |
| 1737 | Change Minimum Characters to Satisfy One of Three Conditions | Medium |
| 1738 | Find Kth Largest XOR Coordinate Value | Medium |
| 1739 | Building Boxes | Hard |
| 1741 | Find Total Time Spent by Each Employee | Easy |
| 1742 | Maximum Number of Balls in a Box | Easy |
| 1743 | Restore the Array From Adjacent Pairs | Medium |
| 1744 | Can You Eat Your Favorite Candy on Your Favorite Day? | Medium |
| 1745 | Palindrome Partitioning IV | Hard |
| 1748 | Sum of Unique Elements | Easy |
| 1749 | Maximum Absolute Sum of Any Subarray | Medium |
| 1750 | Minimum Length of String After Deleting Similar Ends | Medium |
| 1751 | Maximum Number of Events That Can Be Attended II | Hard |
| 1752 | Check if Array Is Sorted and Rotated | Easy |
| 1753 | Maximum Score From Removing Stones | Medium |
| 1754 | Largest Merge Of Two Strings | Medium |
| 1755 | Closest Subsequence Sum | Hard |
| 1757 | Recyclable and Low Fat Products | Easy |
| 1758 | Minimum Changes To Make Alternating Binary String | Easy |
| 1759 | Count Number of Homogenous Substrings | Medium |
| 1760 | Minimum Limit of Balls in a Bag | Medium |
| 1761 | Minimum Degree of a Connected Trio in a Graph | Hard |
| 1763 | Longest Nice Substring | Easy |
| 1764 | Form Array by Concatenating Subarrays of Another Array | Medium |
| 1765 | Map of Highest Peak | Medium |
| 1766 | Tree of Coprimes | Hard |
| 1768 | Merge Strings Alternately | Easy |
| 1769 | Minimum Number of Operations to Move All Balls to Each Box | Medium |
| 1770 | Maximum Score from Performing Multiplication Operations | Hard |
| 1771 | Maximize Palindrome Length From Subsequences | Hard |
| 1773 | Count Items Matching a Rule | Easy |
| 1774 | Closest Dessert Cost | Medium |
| 1775 | Equal Sum Arrays With Minimum Number of Operations | Medium |
| 1776 | Car Fleet II | Hard |
| 1779 | Find Nearest Point That Has the Same X or Y Coordinate | Easy |
| 1780 | Check if Number is a Sum of Powers of Three | Medium |
| 1781 | Sum of Beauty of All Substrings | Medium |
| 1782 | Count Pairs Of Nodes | Hard |
| 1784 | Check if Binary String Has at Most One Segment of Ones | Easy |
| 1785 | Minimum Elements to Add to Form a Given Sum | Medium |
| 1786 | Number of Restricted Paths From First to Last Node | Medium |
| 1787 | Make the XOR of All Segments Equal to Zero | Hard |
| 1789 | Primary Department for Each Employee | Easy |
| 1790 | Check if One String Swap Can Make Strings Equal | Easy |
© 2026 PhantomCodeAI. All rights reserved.