Implement `trieHasWord(words, word)` that builds a trie from `words` and returns whether `word` is a complete stored word.
+ 1 hidden test run on Submit.
A trie stores words character by character; the end flag distinguishes a full word from a prefix. Lookup is O(word length).
Run your code to see results.