Trie Challenge 1 where it says
The second implementation uses a trie of strings. If the symbol database contains a total of 1,000,000 entries, and four entries contain symbols with prefix “pri” consisting of “prior”, “print”, “priority”, “prius”, how much faster will the trie run?
It’s a bit confusing because, at least for me, it doesn’t say which action to compare. It just says some information about the trie. It would be better to say: "how much faster will the trie run when user enters “pri” "