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 →
All Posts
1575 articles
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 →
dsa2 min read
Word Search Problems — Trie + Backtracking Patterns
Word Search I and II solved with DFS backtracking. Word Search II uses a Trie to prune the search space from O(N·4^L) per word to O(N·4^L) total for all words.
Read →
Page 292 of 315