1879 | Minimum XOR Sum of Two Arrays | Hard |
1883 | Minimum Skips to Arrive at Meeting On Time | Hard |
1884 | Egg Drop With 2 Eggs and N Floors | Medium |
1888 | Minimum Number of Flips to Make the Binary String Alternating | Medium |
1896 | Minimum Cost to Change the Final Value of Expression | Hard |
1900 | The Earliest and Latest Rounds Where Players Compete | Hard |
1911 | Maximum Alternating Subsequence Sum | Medium |
1916 | Count Ways to Build Rooms in an Ant Colony | Hard |
1928 | Minimum Cost to Reach Destination in Time | Hard |
1931 | Painting a Grid With Three Different Colors | Hard |
1937 | Maximum Number of Points with Cost | Medium |
1947 | Maximum Compatibility Score Sum | Medium |
1955 | Count Number of Special Subsequences | Hard |
1959 | Minimum Total Space Wasted With K Resizing Operations | Medium |
1976 | Number of Ways to Arrive at Destination | Medium |
1977 | Number of Ways to Separate Numbers | Hard |
1981 | Minimize the Difference Between Target and Chosen Elements | Medium |
1986 | Minimum Number of Work Sessions to Finish the Tasks | Medium |
1987 | Number of Unique Good Subsequences | Hard |
1994 | The Number of Good Subsets | Hard |
1997 | First Day Where You Have Been in All the Rooms | Medium |
2002 | Maximum Product of the Length of Two Palindromic Subsequences | Medium |
2003 | Smallest Missing Genetic Value in Each Subtree | Hard |
2008 | Maximum Earnings From Taxi | Medium |
2019 | The Score of Students Solving Math Expression | Hard |
2035 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard |
2050 | Parallel Courses III | Hard |
2054 | Two Best Non-Overlapping Events | Medium |
2060 | Check if an Original String Exists Given Two Encoded Strings | Hard |
2063 | Vowels of All Substrings | Medium |