dsa2 min read
Suffix Array — O(n log n) Construction and Applications
Build a suffix array in O(n log²n) using doubling sort. Enables O(m log n) substring search, longest common substring, and number of distinct substrings.
Read →
All Posts
1276 articles
dsa2 min read
Longest Common Substring — DP and Rolling Hash Approaches
Find the longest common substring between two strings. DP approach O(nm), binary search + rolling hash O((n+m) log(n+m)).
Read →
dsa2 min read
String DP — Edit Distance, LCS, and Interleaving
Core string DP patterns: edit distance (Wagner-Fischer), longest common subsequence, interleaving strings, and regular expression matching.
Read →
dsa2 min read
Anagram Problems — Sorting Key, Frequency Vector, and Rolling Hash
Group anagrams, find anagram indices, and count anagram occurrences. Three approaches: sort key O(nk log k), frequency tuple O(nk), and sliding window O(n+k).
Read →
dsa2 min read
Palindrome Problems — Expand Around Centre, DP, and Manacher
Comprehensive palindrome problem coverage: valid palindrome check, longest palindromic substring (three methods), count palindromic substrings, and palindrome partitioning.
Read →
Page 232 of 256