Given an array of words where no word is the prefix of another, find the shortest unique prefix to identify each word in the array uniquely.
For example,
The idea is to construct a Trie from given words. While inserting the words in Trie, keep track of the total number of times each Trie node is visited. This can be easily done by maintaining an extra field in each Trie node for storing the frequency. Each Trie node’s frequency is initially 0 and incremented by one each time the Trie node is visited during the insertion of a word.
Finally, traverse the Trie in a preorder fashion to print the shortest unique prefix for each word in the Trie. For every Trie node being traversed, check its frequency. The prefix ending at a Trie node is the shortest unique prefix if its frequency is 1. Once the shortest unique prefix is identified, move to the next path in preorder traversal instead of traversing down further on the current Trie node.
Note that a prefix comprises all characters in the path from root to Trie node. The algorithm can be implemented as follows in C++, Java, and Python:
C++
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
|
#include <iostream>
#include <vector>
#include <map>
#include <string>
using namespace std;
// A Trie node
struct TrieNode
{
// each node stores a map to its child nodes
map<char, TrieNode*> child;
// keep track of the total number of times the current node is visited
// while inserting data in Trie
int freq = 0;
};
// Function to insert a given string in a Trie
void insert(TrieNode* &root, string word)
{
// start from the root node
TrieNode *curr = root;
for (char c: word)
{
// create a new node if the path doesn’t exist
if (curr->child.find(c) == curr->child.end()) {
curr->child[c] = new TrieNode();
}
// increment frequency
curr->child[c]->freq++;
// go to the next node
curr = curr->child[c];
}
}
// Function to recursively traverse the Trie in a preorder fashion and
// print the shortest unique prefix for each word in the Trie
void printShortestPrefix(TrieNode *root, string word_so_far)
{
if (root == nullptr) {
return;
}
// print `word_so_far` if the current Trie node is visited only once
if (root->freq == 1) {
cout << word_so_far << endl;
return;
}
// recur for all child nodes
for (auto &child: root->child) {
printShortestPrefix(child.second, word_so_far + child.first);
}
}
// Find the shortest unique prefix for every word in a given array
void findShortestPrefix(vector<string> &words)
{
// construct a Trie from the given items
TrieNode *root = new TrieNode();;
for (string s: words) {
insert(root, s);
}
// Recursively traverse the Trie in a preorder fashion to list all prefixes
printShortestPrefix(root, “”);
}
int main()
{
vector<string> words = { “AND”, “BOOL”, “BONFIRE”, “CATCH”, “CASE”, “CHAR” };
findShortestPrefix(words);
return 0;
}
|
Output:
A
BON
BOO
CAS
CAT
CH
Java
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
import java.util.HashMap;
import java.util.Map;
// A Trie node
class TrieNode
{
// each node stores a map to its child nodes
Map<Character, TrieNode> child = new HashMap<>();
// keep track of the total number of times the current node is visited
// while inserting data in Trie
int freq = 0;
}
class Main {
// Function to insert a given string in a Trie
public static void insert(TrieNode root, String word)
{
// start from the root node
TrieNode curr = root;
for (char c: word.toCharArray())
{
// create a new node if the path doesn’t exist
curr.child.putIfAbsent(c, new TrieNode());
// increment frequency
curr.child.get(c).freq++;
// go to the next node
curr = curr.child.get(c);
}
}
// Function to recursively traverse the Trie in a preorder fashion and
// print the shortest unique prefix for each word in the Trie
public static void printShortestPrefix(TrieNode root, String word_so_far)
{
if (root == null) {
return;
}
// print `word_so_far` if the current Trie node is visited only once
if (root.freq == 1) {
System.out.println(word_so_far);
return;
}
// recur for all child nodes
for (Map.Entry<Character, TrieNode> child: root.child.entrySet()) {
printShortestPrefix(child.getValue(), word_so_far + child.getKey());
}
}
// Find the shortest unique prefix for every word in a given array
public static void findShortestPrefix(String[] words)
{
// construct a Trie from the given items
TrieNode root = new TrieNode();
for (String s: words) {
insert(root, s);
}
// Recursively traverse the Trie in a preorder fashion to list all prefixes
printShortestPrefix(root, “”);
}
public static void main(String[] args)
{
String[] words = { “AND”, “BOOL”, “BONFIRE”, “CATCH”, “CASE”, “CHAR” };
findShortestPrefix(words);
}
}
|
Output:
A
BON
BOO
CAS
CAT
CH
Python
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
# A Trie node
class TrieNode:
def __init__(self):
# each node stores a dictionary to its child nodes
self.child = {}
# keep track of the total number of times the current node is visited
# while inserting data in Trie
self.freq = 0
# Function to insert a given string in a Trie
def insert(root, word):
# start from the root node
curr = root
for c in word:
# create a new node if the path doesn’t exist
curr.child.setdefault(c, TrieNode())
# increment frequency
curr.child[c].freq += 1
# go to the next node
curr = curr.child[c]
# Function to recursively traverse the Trie in a preorder fashion and
# print the shortest unique prefix for each word in the Trie
def printShortestPrefix(root, word_so_far):
if root is None:
return
# print `word_so_far` if the current Trie node is visited only once
if root.freq == 1:
print(word_so_far)
return
# recur for all child nodes
for k, v in root.child.items():
printShortestPrefix(v, word_so_far + k)
# Find the shortest unique prefix for every word in a given array
def findShortestPrefix(words):
# construct a Trie from the given items
root = TrieNode()
for s in words:
insert(root, s)
# Recursively traverse the Trie in a preorder fashion to list all prefixes
printShortestPrefix(root, ”)
if __name__ == ‘__main__’:
words = [‘AND’, ‘BOOL’, ‘BONFIRE’, ‘CATCH’, ‘CASE’, ‘CHAR’]
findShortestPrefix(words)
|
Output:
A
BOO
BON
CAT
CAS
CH
Download Run Code
Output:
A
BON
BOO
CAS
CAT
CH
Download Run Code
Output:
A
BON
BOO
CAS
CAT
CH
