Difficulty:
Tag:
IDTitleDifficulty
1879Minimum XOR Sum of Two ArraysHard
1883Minimum Skips to Arrive at Meeting On TimeHard
1884Egg Drop With 2 Eggs and N FloorsMedium
1888Minimum Number of Flips to Make the Binary String AlternatingMedium
1896Minimum Cost to Change the Final Value of ExpressionHard
1900The Earliest and Latest Rounds Where Players CompeteHard
1911Maximum Alternating Subsequence SumMedium
1916Count Ways to Build Rooms in an Ant ColonyHard
1928Minimum Cost to Reach Destination in TimeHard
1931Painting a Grid With Three Different ColorsHard
1937Maximum Number of Points with CostMedium
1947Maximum Compatibility Score SumMedium
1955Count Number of Special SubsequencesHard
1959Minimum Total Space Wasted With K Resizing OperationsMedium
1976Number of Ways to Arrive at DestinationMedium
1977Number of Ways to Separate NumbersHard
1981Minimize the Difference Between Target and Chosen ElementsMedium
1986Minimum Number of Work Sessions to Finish the TasksMedium
1987Number of Unique Good SubsequencesHard
1994The Number of Good SubsetsHard
1997First Day Where You Have Been in All the RoomsMedium
2002Maximum Product of the Length of Two Palindromic SubsequencesMedium
2003Smallest Missing Genetic Value in Each SubtreeHard
2008Maximum Earnings From TaxiMedium
2019The Score of Students Solving Math ExpressionHard
2035Partition Array Into Two Arrays to Minimize Sum DifferenceHard
2050Parallel Courses IIIHard
2054Two Best Non-Overlapping EventsMedium
2060Check if an Original String Exists Given Two Encoded StringsHard
2063Vowels of All SubstringsMedium