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
hrithox_2000:
20210213 16:00:15
a good problem can be solved using a map and checking the node coming how many times in the trie tree 

ti18padung:
20201124 13:48:38
hurraay 

navneet_01:
20201029 10:38:52
If using trie without sorting


robosapien:
20200621 00:57:53
If you're getting WA with trie, try this


dmorgans:
20200511 15:10:37
my 51st


ck_17:
20200508 11:16:40
it will have leading zeros.


asanyal122:
20200429 14:47:38
similar problem from hackerrank No Prefix Set.


manish_thakur:
20200323 08:11:24
YAY, first tries question , good for learning


killer_knight:
20191016 15:34:21
be careful with phone nos starting with zeros :) 

sanket17:
20190713 10:26:20
Brute force

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 