Difficulty:
Tag:
IDTitleDifficulty
1743Restore the Array From Adjacent PairsMedium
1750Minimum Length of String After Deleting Similar EndsMedium
1751Maximum Number of Events That Can Be Attended IIHard
1752Check if Array Is Sorted and RotatedEasy
1759Count Number of Homogenous SubstringsMedium
1761Minimum Degree of a Connected Trio in a GraphHard
1774Closest Dessert CostMedium
1790Check if One String Swap Can Make Strings EqualEasy
1800Maximum Ascending Subarray SumEasy
1814Count Nice Pairs in an ArrayMedium
1822Sign of the Product of an ArrayEasy
1824Minimum Sideway JumpsMedium
1834Single-Threaded CPUMedium
1838Frequency of the Most Frequent ElementMedium
1845Seat Reservation ManagerMedium
1846Maximum Element After Decreasing and RearrangingMedium
1851Minimum Interval to Include Each QueryHard
1870Minimum Speed to Arrive on TimeMedium
1877Minimize Maximum Pair Sum in ArrayMedium
1879Minimum XOR Sum of Two ArraysHard
1884Egg Drop With 2 Eggs and N FloorsMedium
1887Reduction Operations to Make the Array Elements EqualMedium
1897Redistribute Characters to Make All Strings EqualEasy
1903Largest Odd Number in StringEasy
1913Maximum Product Difference Between Two PairsEasy
1921Eliminate Maximum Number of MonstersMedium
1930Unique Length-3 Palindromic SubsequencesMedium
1937Maximum Number of Points with CostMedium
1942The Number of the Smallest Unoccupied ChairMedium
1964Find the Longest Valid Obstacle Course at Each PositionHard