Sde3

I just took phone screen for sde3 at Amazon. The interviewer asked a question based on trie and dfs similar to one of the word search in LC wherein I had to find all the valid words in a given 2d matrix and verify them against a dictionary for validity. In the beginning I pitched in the idea of using a trie for dictionary but the interviewer mentioned since the list of words will be huge, stupid me completely dumped the idea of using a trie. I misunderstood him thinking he's discouraging the idea of using a trie. So I came up a with brute force solution using a dfs traversal and using a list/set for dictionary. But trie would have been better to search for prefix and discard the prefix. He mentioned this in the end. I did code up working solution for the brute force approach and also wrote a trie and insert function but could not complete it. Although I did clarify the confusion in the end. He did say he wasn't looking for most optimal solution. Just wanted to see the approach. I don't know what to make of it.