1Zigzag ConversionMediumString
Solve → 2Generate ParenthesesMediumStringDynamic ProgrammingBacktracking
Solve → 3Zigzag ConversionMediumString
Solve → 4Valid ParenthesesEasyStringStack
Solve → 5Generate ParenthesesMediumStringDynamic ProgrammingBacktracking
Solve → 6Wildcard MatchingHardStringDynamic ProgrammingGreedy
Solve → 7Zigzag ConversionMediumString
Solve → 8Minimum Remove to Make Valid ParenthesesMediumStringStack
Solve → 9Decode WaysMediumStringDynamic Programming
Solve → 10Remove All Adjacent Duplicates in String IIMediumStringStack
Solve → 11Remove K DigitsMediumStringStackGreedy
Solve → 12Longest Common SubsequenceMediumStringDynamic Programming
Solve → 13Number of Ways to Separate NumbersHardStringDynamic ProgrammingPrefix Sum
Solve → 14Count Different Palindromic SubsequencesHardStringDynamic Programming
Solve → 15Edit DistanceMediumStringDynamic Programming
Solve → 16Valid ParenthesesEasyStringStack
Solve → 17Generate ParenthesesMediumStringDynamic ProgrammingBacktracking
Solve → 18Number of Ways to Separate NumbersHardStringDynamic ProgrammingPrefix Sum
Solve → 19Zigzag ConversionMediumString
Solve → 20Decode WaysMediumStringDynamic Programming
Solve → 21Wildcard MatchingHardStringDynamic ProgrammingGreedy
Solve → 22Minimum Remove to Make Valid ParenthesesMediumStringStack
Solve → 23Remove All Adjacent Duplicates in String IIMediumStringStack
Solve → 24Remove K DigitsMediumStringStackGreedy
Solve → 25Longest Common SubsequenceMediumStringDynamic Programming
Solve → 26Count Different Palindromic SubsequencesHardStringDynamic Programming
Solve → 27Edit DistanceMediumStringDynamic Programming
Solve → 28Decode StringMediumStringStackRecursion
Solve →