What’s the problem in this code
Digital Dictionary
I am not able to understand your solution. Is there any other way to do this question??
In this problem you need to create a Trie data structure of all the words that are in the dictionary. Now, in queres, we need to just check the words which have the prefix same as given in input. And than we need to use DFS for getting all the possibilities of words. Thus the max words visited will be all the words in dictionary.
we will have to use tries only for efficient code…
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.