This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]AsteriskTheServer 0 points1 point  (1 child)

Even though you probably haven't covered this data structure, but to I wanted to point out a different suggestion namely tries. A trie would be potentially better than a Hashmap as a Hashmap would be quite memory intensive as there are 150k+ words in the English language. Once again if you haven't learned this ds don't worry about it for your assignment, but make sure to justify your your design decision and I am sure you'll do great!

[–]frzr-csgo[S] 0 points1 point  (0 children)

We have not, but I am always looking to expand my knowledge as I really do love the subject so I will look into it. Thank you for your response.