Topic 21 of 21
Advanced String Problems
String hashing, Rabin-Karp, the Z-function, KMP and the LPS array, shortest palindrome and longest happy prefix.
9 advanced string problems (1 easy, 3 medium, 5 hard) with LeetCode and GeeksforGeeks links.
Your progress
– / 9 solved
- Easy
- –/1
- Medium
- –/3
- Hard
- –/5
/
- Minimum Number of Bracket Reversals Needed to Make an Expression BalancedMediumLeetCodeGFG
- Count and SayMediumLeetCodeGFG
- Hashing in Strings | TheoryMedium
- Rabin KarpHardLeetCodeGFG
- Z-FunctionEasyLeetCodeGFG
- KMP Algorithm / LPS (Pi) ArrayHardLeetCodeGFG
- Shortest PalindromeHardLeetCode
- Longest Happy PrefixHardLeetCodeGFG
- Count Palindromic Subsequences in Given StringHardGFG