General Discussion
In reply to the discussion: For those who think that there is a skills shortage, let me tell you about my Google job interview [View all]mathematic
(1,602 posts)The lookup complexity is O(log n), not O(n log n). Think about it... would the lookup time on a binary sorted data be GREATER than the lookup time on completely unsorted data, which is O(n)?
You got this basic fact wrong and appear to think that the question was trivial. Perhaps that's why you weren't offered more difficult questions. It's like those computer adaptive tests. They start you off with the easy questions and only give you the hard ones if you get the easy ones right.
Your answer to the second question is also suspect. There is no correct answer to the storage question. How much storage you need depends on the design tradeoffs you make with your hash table implementation. If you just gave him a number then you got the question wrong. The way to answer the question is to describe the different tradeoffs and the storage requirements entailed.
The third question is just the icing on the cake. You demonstrated an unwillingness to communicate your code verbally, an important skill for software developers, for obvious reasons.
Other people have suggested your temperament or other personality reasons for the lack of call back but it's clear that you didn't get the call back because you are simply not technically qualified to work at google.