CareerCup

FWIW, I said trie during the interview and justified it with all of the repetition of letters in words. my structure had the following fields:

1. char data
2. int is_legitimate_ending (e.g. can a word end at this node)
3. node **children (dynamically allocated array of node pointers)

I debated using a double pointer for children or an array of pointers (e.g. size 256 if assuming ASCII) but went with the double ptr because you can (1) save space and (2) include more than 256 characters. array would have had a more constant time lookup than iterating through the dynamically allocated array though.

I had about 30 minutes for the problem. I only had to define the structure and write the verify() method. I did not have to code building & inserting.

Is the verify implementation mean: if the word is not found in Dictionary its misspelled else correct word.

@searching, yes that is correct.

you're welcome! :)

@woohoo

keep up the good work :) FTW