String Problems

Sliding window, hashing, palindrome logic, pattern matching, and interview-grade string techniques.

Filter by difficulty:
Min Window
Smallest window containing all charactersHard
Smallest window with exact frequency matchHard
Palindrome
Longest palindromic substring Medium
Check if a number is a palindrome Easy
Check if a string is a palindrome Easy
Valid palindrome (ignore non-alphanumeric) Easy
Palindrome after removing at most one character Medium
Check if a stream forms a palindrome Hard
All palindromic partitions Medium
Pattern Search Algorithms
KMP Algorithm Hard
Z Algorithm Hard
Longest happy prefix Medium
Shortest palindrome Hard
Other Important Problems
Multiply two number strings Medium
Check if strings are rotations Easy
Compare version numbers Medium
Decode encoded string (e.g. 3[a2[c]]) Medium
Excel sheet column title / number Easy
Isomorphic strings Easy
Is subsequence Easy
Longest substring without repeating characters Medium
Substring with concatenation of all words Hard
Group Anagrams Medium