Least You Need to Know: Tries, Prefix Search, and Shared Prefix Structure
เปิดบทเรียน
A trie stores strings by characters along root-to-node paths. It is useful when many words share prefixes and the interview task asks about prefix lookup, autocomplete, or word-search branching.