problem208

README

< Previous 　　　　　　　　　　　　　　　　 Next >

208. Implement Trie (Prefix Tree) (Medium)

Implement a trie with insert, search, and startsWith methods.

Example:

Trie trie = new Trie();

trie.insert("apple");
trie.search("apple");   // returns true
trie.search("app");     // returns false
trie.startsWith("app"); // returns true
trie.insert("app");   
trie.search("app");     // returns true

Note:

• You may assume that all inputs are consist of lowercase letters a-z.
• All inputs are guaranteed to be non-empty strings.

Related Topics

[Design] [Trie]

Similar Questions

1. Add and Search Word - Data structure design (Medium)
2. Design Search Autocomplete System (Hard)
3. Replace Words (Medium)
4. Implement Magic Dictionary (Medium)