trie (prefix tree for strings) (prefix tree) stores strings character by character, with each node representing a prefix. You use it when searching for words by prefix or when multiple strings share common prefixes. Trie enables search where L is word length, independent of dictionary size.
You'll see this in autocomplete, spell checking, and word search problems. If you can explain these concepts in your own words, you'll solve related problems faster under interview pressure.
