ID NAME QUALITY USERS ACC % DIFFICULTY C I
37443 Acronym II   4 29
34
34
28305 Ada and Indexing   59 1988
15
15

#trie-1

A trie (prefix tree) is an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings

https://en.wikipedia.org/wiki/Trie https://www.youtube.com/watch?v=NdfIfxTsVDo - video lecture