Comments on Hexagrammatic: Data Structures: Try to Trie

Bill, Thanks a lot for posting this nice and easy...

2009-07-21T07:05:10.064-07:00

Bill,

Thanks a lot for posting this nice and easy implementation of Trie.

-Addy

this reminds me of that word/number problem that i...

2009-03-16T17:36:00.000-07:00

this reminds me of that word/number problem that i got obsessed with back in april/may. do you remember that? i'll have to dig up my source to see how it compares.

It becomes clear to me now that I should have hung...

2009-01-22T06:25:00.000-08:00

It becomes clear to me now that I should have hung with you more while in the process of getting my CSC degree.

I dread the white board in interviews. I look like an idiot every time I use one.

I often find that the white board part of an interview tells me next to nothing about what a candidate is capable of. But that of course comes from the bias that I, personally am unable to show my own competence in white board interviews.

For some dictionaries, it could be smaller to stor...

2009-01-21T21:55:00.000-08:00

For some dictionaries, it could be smaller to store the entire thing in a hashmap, and thats actually what a compressed trie would look like if there were no common leading sequences in your dictionary. I recall implementing a compressed trie back in school, where you store a set of bytes as the key to the hashmap instead of a single byte, but I believe that something more like a balanced tree is preferred over a hash in that case for storing the path in each trie, since you have to dynamically break apart the keys over time.