Just got off the phone...
I just got off the phone... and I think I did pretty well.
Here are the questions that he asked me:
Given 2 strings (as character arrays) A and B, how would you determine if the characters in B were a subset of the characters in A.
Given that there are about 4 billion pages indexed by Google, how would you keep from indexing the same page twice?
What is a cool project you've been thinking about? (something you might work on in your "20% time" at Google).
I also found out about some pretty sweet perks at Google
Now, lets all cross our collective fingers... and hope Adam gets his dream job at Google.
Here are the questions that he asked me:
Given 2 strings (as character arrays) A and B, how would you determine if the characters in B were a subset of the characters in A.
Given that there are about 4 billion pages indexed by Google, how would you keep from indexing the same page twice?
What is a cool project you've been thinking about? (something you might work on in your "20% time" at Google).
I also found out about some pretty sweet perks at Google
- Free lunch and dinner - great for people just coming out of College
- 20% time - 20% of your time is spent working on any project you want
- Free Massages - I don't remember how often you can get them... but, still...
- The whole Moutainview, CA staff goes on a ski trip to Tahoe every year in Januarary... with skiing competitions :-D
Now, lets all cross our collective fingers... and hope Adam gets his dream job at Google.
8 Comments
if (!hasLetter[b[i]])
return(FALSE);
???
Comments are closed. This is an archived blog.