Google Interview Question

efficiently search for an input word in an unbounded dictionary.

Interview Answers

Anonymous

Apr 19, 2011

To reply to the above, by "unbounded" here it is probably meant "very large, and with unknown size". As such, it can be sorted. First poster is correct.

Anonymous

Jun 24, 2012

if it is unbounded and size is really large, B+ tree would be a good choice

Anonymous

Oct 22, 2010

In an unbounded dictionary, words probably are not sorted.