Implement a Trie (Prefix Tree) for Efficient Word Search.
HardProblem Statement
Implement a Trie (Prefix Tree) for Efficient Word Search.
Sample Input
Insert("apple") -> Search("app")Sample Output
true
Limits
Time: 2s · Memory: 256 MB
Implement a Trie (Prefix Tree) for Efficient Word Search.
Insert("apple") -> Search("app")true
Time: 2s · Memory: 256 MB