Difficulty:
Tag:
IDTitleDifficulty
1593Split a String Into the Max Number of Unique SubstringsMedium
1600Throne InheritanceMedium
1604Alert Using Same Key-Card Three or More Times in a One Hour PeriodMedium
1624Largest Substring Between Two Equal CharactersEasy
1636Sort Array by Increasing FrequencyEasy
1638Count Substrings That Differ by One CharacterMedium
1640Check Array Formation Through ConcatenationEasy
1656Design an Ordered StreamEasy
1657Determine if Two Strings Are CloseMedium
1658Minimum Operations to Reduce X to ZeroMedium
1674Minimum Moves to Make Array ComplementaryMedium
1679Max Number of K-Sum PairsMedium
1684Count the Number of Consistent StringsEasy
1695Maximum Erasure ValueMedium
1711Count Good MealsMedium
1713Minimum Operations to Make a SubsequenceHard
1726Tuple with Same ProductMedium
1737Change Minimum Characters to Satisfy One of Three ConditionsMedium
1742Maximum Number of Balls in a BoxEasy
1743Restore the Array From Adjacent PairsMedium
1748Sum of Unique ElementsEasy
1763Longest Nice SubstringEasy
1775Equal Sum Arrays With Minimum Number of OperationsMedium
1781Sum of Beauty of All SubstringsMedium
1790Check if One String Swap Can Make Strings EqualEasy
1796Second Largest Digit in a StringEasy
1797Design Authentication ManagerMedium
1805Number of Different Integers in a StringEasy
1807Evaluate the Bracket Pairs of a StringMedium
1814Count Nice Pairs in an ArrayMedium