Strings are character sequences. Master sliding window substring search, string matching algorithms (KMP, Rabin-Karp rolling hash), palindrome verification, and frequency map hashing in C++.
Frequency Array Vector: Uses 26-size integer array 'vector<int> count(26, 0)' for O(1) space ASCII hashing.
Sliding Window Substring: Solves longest substring without repeating characters in linear time.
KMP Pattern Search: Computes Longest Prefix Suffix (LPS) table to achieve O(N + M) substring matching.
Rabin-Karp Rolling Hash: Hashes pattern and text windows using polynomial rolling hash functions.