Trie – Interview Questions and Practice Problems

Trie is a tree-based data structure, used for efficient retrieval of a key in a large data-set of strings. Unlike a binary search tree, where the node in the tree stores the key associated with that node, the Trie node’s position in a tree defines the key with which it is associated, and the key is only associated with the leaves. It is also known as prefix tree as all descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string.

 
Following are the list of commonly asked Trie interview questions:

1. Trie Implementation – C, C++, C++ (Memory Efficient), Java, PythonBeginner
2. Longest Common Prefix in a given set of strings (using Trie)Medium
3. Lexicographic sorting of a given set of keysMedium
4. Find the maximum occurring word in a given set of stringsEasy
5. Find first k maximum occurring words in a given set of stringsMedium
6. Find duplicate rows in a binary matrixMedium
7. Word Break Problem – Using Trie Data StructureMedium
8. Generate a list of possible words from a character matrixHard
9. Find all words matching a pattern in the given dictionaryMedium
10. Find the shortest unique prefix for every word in an arrayMedium