Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I am preparing for my interview and came across this question:
Consider that i have 1000,000 words and i want to create a dictionary . The data structure i can use is Map or B+ trees .
But on what criteria should i write my hashcode(), so that the retrieval can be fast.
would welcome everybody views…
I would use neither and store the dictionary as a Patricia trie instead.
It also uses less memory since you’re not storing all the common prefixes of all strings separately.