Difficulty:
Tag:
IDTitleDifficulty
1930Unique Length-3 Palindromic SubsequencesMedium
1937Maximum Number of Points with CostMedium
1942The Number of the Smallest Unoccupied ChairMedium
1980Find Unique Binary StringMedium
2024Maximize the Confusion of an ExamMedium
2038Remove Colored Pieces if Both Neighbors are the Same ColorMedium
2058Find the Minimum and Maximum Number of Nodes Between Critical PointsMedium
2096Step-By-Step Directions From a Binary Tree Node to AnotherMedium
2125Number of Laser Beams in a BankMedium
2130Maximum Twin Sum of a Linked ListMedium
2140Solving Questions With BrainpowerMedium
2181Merge Nodes in Between ZerosMedium
2192All Ancestors of a Node in a Directed Acyclic GraphMedium
2196Create Binary Tree From DescriptionsMedium
2244Minimum Rounds to Complete All TasksMedium
2265Count Nodes Equal to Average of SubtreeMedium
2289Steps to Make Array Non-decreasingMedium
2305Fair Distribution of CookiesMedium
2320Count Number of Ways to Place HousesMedium
2353Design a Food Rating SystemMedium
2369Check if There is a Valid Partition For The ArrayMedium
2374Node With Highest Edge ScoreMedium
2384Largest Palindromic NumberMedium
2385Amount of Time for Binary Tree to Be InfectedMedium
2390Removing Stars From a StringMedium
2391Minimum Amount of Time to Collect GarbageMedium
2400Number of Ways to Reach a Position After Exactly k StepsMedium
2433Find The Original Array of Prefix XorMedium
2461Maximum Sum of Distinct Subarrays With Length KMedium
2466Count Ways To Build Good StringsMedium