PHONELST  Phone List
Phone List
Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers:
 Emergency 911
 Alice 97 625 999
 Bob 91 12 54 26
In this case, it’s not possible to call Bob, because the central would direct your call to the emergency line as soon as you had dialled the first three digits of Bob’s phone number. So this list would not be consistent.
Input
The first line of input gives a single integer, 1 <= t <= 40, the number of test cases. Each test case starts with n, the number of phone numbers, on a separate line, 1 <= n <= 10000. Then follows n lines with one unique phone number on each line. A phone number is a sequence of at most ten digits.
Output
For each test case, output “YES” if the list is consistent, or “NO” otherwise.
Example
Input: 2 3 911 97625999 91125426 5 113 12340 123440 12345 98346 Output: NO YES
hide comments
Yauhen:
20180913 16:27:44
Ac in 1 go using ONLY sorting (not trie....). 

ajay_5097:
20180814 11:30:37
Similar Problem on Hackerrank "no prefix set".


vivek_dwivedi:
20180701 07:16:35
invested so many hours to learn try then ac in a go ! Emotional moment for me :')


rohitnarayan:
20180617 14:14:04
Finally got accepted after few WA !! My first Trie. :P 

imkiller:
20180531 12:27:50
Simple Trie 

a_98:
20180521 19:40:19
My First Using Tries ! 

zenosama:
20180228 17:22:56
Nice problem for beginners Last edit: 20180305 16:22:36 

avik26091998:
20180111 19:41:17
Good problem for implementing Trie... 

somanshu_s:
20171210 13:26:54
You don't need to use trie for this question . It can be done using stl maps . 

javafreak:
20171002 05:55:00
Trie data structure, little painful to implement in C though , overall was fine. 
Added by:  Andres Galvis 
Date:  20090308 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  Nordic Collegiate Programming Contest 2007 