Implement Trie (Prefix Tree) · Coding Interview Practice

Implement Trie (Prefix Tree)Implement a trie supporting insert, search (full word), and startsWith (prefix) operations.Constraints

1 <= word.length, prefix.length <= 2000

All inputs consist of lowercase English letters

At most 3 * 10^4 calls are made

Examples

Input: insert("apple"), search("apple") Output: true

Input: search("app"), startsWith("app") Output: search=false, startsWith=true

LetsDiscuss

Loading your session…