**Trie - Amazon Top Interview Questions**

### Problem Statement :

Implement a trie data structure with the following methods: Trie() constructs a new instance of a trie add(String word) adds a word into the trie exists(String word) returns whether word exists in the trie startswith(String p) returns whether there's some word whose prefix is p Constraints n ≤ 100,000 where n is the number of calls to add, exists and startswith Example 1 Input methods = ["constructor", "add", "add", "exists", "startswith", "exists"] arguments = [[], ["dog"], ["document"], ["dog"], ["doc"], ["doge"]]` Output [None, None, None, True, True, False] Explanation We create a Trie We add the word "dog" to the trie We add the word "document" to the trie We check whether "dog" exists in the trie which it does We check whether there is some word whose prefix is "doc" which there is ("document) We check whether "doge" exists in the trie which it does not

### Solution :

` ````
Solution in C++ :
class Trie { // Time: O(L) for every operation, where L is the length of the input string
private:
bool is_word;
Trie* children[26];
public:
Trie() { // Constructor
is_word = false;
for (int i = 0; i < 26; i++) children[i] = nullptr;
}
~Trie() { // Destructor
for (int i = 0; i < 26; i++)
if (children[i]) delete children[i]; // Release children nodes
}
Trie* search(string& word) {
Trie* node = this;
for (char c : word) {
if (node->children[c - 'a'] == nullptr) return nullptr;
node = node->children[c - 'a'];
}
return node;
}
void add(string s) {
Trie* node = this;
for (char c : s) {
if (node->children[c - 'a'] == nullptr) node->children[c - 'a'] = new Trie();
node = node->children[c - 'a'];
}
node->is_word = true;
}
bool exists(string word) {
Trie* node = search(word);
return (node != nullptr) && (node->is_word);
}
bool startswith(string p) {
Trie* node = search(p);
return node != nullptr;
}
};
```

` ````
Solution in Python :
class Node:
def __init__(self):
self.children = defaultdict(Node)
self.end = False
class Trie:
def __init__(self):
self.root = Node()
def add(self, s):
"""We simply iterate through the word and add each character
one by one. since we are using a defaultdict, we don't need
to worry about creating a new node if a child doesn't exist
In the end we set the `end` flag of the current node to true
"""
cur = self.root
for c in s:
cur = cur.children[c]
cur.end = True
def exists(self, word):
"""
We go by each character and see if the current node has a child
mapped to that character. if it doesn't, return false. else keep
going down. In the end check if the node's end flag is set to true
"""
cur = self.root
for c in word:
if c not in cur.children:
return False
cur = cur.children[c]
return cur.end
def startswith(self, p):
"""
We go by each character and see if the current node has a child
mapped to that character. if it doesn't, return false. else keep
going down. we just return true without checking the end flag
"""
cur = self.root
for c in p:
if c not in cur.children:
return False
cur = cur.children[c]
return True
```

## View More Similar Problems

## Delete duplicate-value nodes from a sorted linked list

This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty. Example head refers to the first node in the list 1 -> 2 -

View Solution →## Cycle Detection

A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example head refers 1 -> 2 -> 3 -> NUL The numbers shown are the node numbers, not their data values. There is no cycle in this list so return 0. head refer

View Solution →## Find Merge Point of Two Lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the head nodes of 2 linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share

View Solution →## Inserting a Node Into a Sorted Doubly Linked List

Given a reference to the head of a doubly-linked list and an integer ,data , create a new DoublyLinkedListNode object having data value data and insert it at the proper location to maintain the sort. Example head refers to the list 1 <-> 2 <-> 4 - > NULL. data = 3 Return a reference to the new list: 1 <-> 2 <-> 4 - > NULL , Function Description Complete the sortedInsert function

View Solution →## Reverse a doubly linked list

This challenge is part of a tutorial track by MyCodeSchool Given the pointer to the head node of a doubly linked list, reverse the order of the nodes in place. That is, change the next and prev pointers of the nodes so that the direction of the list is reversed. Return a reference to the head node of the reversed list. Note: The head node might be NULL to indicate that the list is empty.

View Solution →## Tree: Preorder Traversal

Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's

View Solution →