Difficulty:
Tag:
IDTitleDifficulty
2530Maximal Score After Applying K OperationsMedium
2531Make Number of Distinct Characters EqualMedium
2536Increment Submatrices by OneMedium
2537Count the Number of Good SubarraysMedium
2541Minimum Operations to Make Array Equal IIMedium
2542Maximum Subsequence ScoreMedium
2545Sort the Students by Their Kth ScoreMedium
2546Apply Bitwise Operations to Make Strings EqualMedium
2550Count Collisions of Monkeys on a PolygonMedium
2554Maximum Number of Integers to Choose From a Range IMedium
2555Maximize Win From Two SegmentsMedium
2556Disconnect Path in a Binary Matrix by at Most One FlipMedium
2559Count Vowel Strings in RangesMedium
2560House Robber IVMedium
2563Count the Number of Fair PairsMedium
2564Substring XOR QueriesMedium
2567Minimum Score by Changing Two ElementsMedium
2568Minimum Impossible ORMedium
2571Minimum Operations to Reduce an Integer to 0Medium
2572Count the Number of Square-Free SubsetsMedium
2575Find the Divisibility Array of a StringMedium
2576Find the Maximum Number of Marked IndicesMedium
2579Count Total Number of Colored CellsMedium
2580Count Ways to Group Overlapping RangesMedium
2583Kth Largest Sum in a Binary TreeMedium
2587Rearrange Array to Maximize Prefix ScoreMedium
2588Count the Number of Beautiful SubarraysMedium
2592Maximize Greatness of an ArrayMedium
2593Find Score of an Array After Marking All ElementsMedium
2594Minimum Time to Repair CarsMedium