InterviewBit Problems   Shortest Unique Prefix : Solved

About the Shortest Unique Prefix : Solved category (1)
[C++] Easy to understand fast solution using trie (1)
[C++] | Using map | Sorry, I didn't knew trie yet (1)
Very Easy and short C++ Trie Solution (1)
Easy C++ solution using trie || O(number of words* max word length) time complexity (1)
Easy to understand | C++ (1)
Simple java solution of O(m*n) (1)
Very well structured c++ code using Trie class i made it, easy to understand (1)
Java trie solution (1)
C++ explanatory solution using unordered_map (1)
Simple C++ solution (using Trie) (1)
Java Solution Using Trie Data Structure (1)
Simple solution using Trie Datastructure (1)
Solved this without using trie or sorting or maps , just simple logic and loops (python 3) (1)
Easy C++ Solution using Trie (1)
C++ Solution using Trie data structure (1)
Easy solution using Maps (1)
Easy Java 8 solution (1)
A very easy [C++] solution using trie! (1)
Using Trie c++. Easy to understand (1)
Solution without using trees (1)
C++ implementation using trie data structure (1)
Python Solution Using Trie (1)
Trie Based C++ solution with image description of the solution (1)
Tries implementation using Array (1)
Shortest Unique Prefix C++ Trie Solution (1)
Short and easy implementation using trie (1)
C++ Solution using only Trie (1)
[JAVA] Easy solution using Trie (1)
Simple solution using trie implemented using unordered_map in C++ (1)