// TOPIC
#strings
4 articles
◆◆IntermediateGoogleAmazon
01Tries (Prefix Trees)
How tries (prefix trees) power autocomplete and spell-check — insert, search, and prefix queries all run in O(L) on word length, not dictionary size.
#tries#trees#strings
12 min◆BeginnerAmazonGoogle
02Strings
Strings are immutable arrays hiding an O(n²) concatenation trap. Learn the sliding window, two-pointer, and hashing patterns that crack string interviews.
#strings#arrays#fundamentals
13 min◆◆◆Advanced
03String Matching: KMP and Rabin-Karp Without the Mysticism
String matching without mysticism: derive KMP's failure function, Rabin-Karp's rolling hash with honest collision math, and the four LeetCode classics.
#string-matching#kmp#rabin-karp
20 min◆◆IntermediateAmazonGoogle
04The Sliding Window Pattern
Learn the sliding window technique: solve longest/shortest subarray and substring problems in O(n) with the expand-right, shrink-left template.
#sliding-window#two-pointers#arrays
11 min