Google Interview Questions
(Posted anonymously by job candidates)
1 Company: 1 - 1 of 1
Google Interviews
163 Interview Questions and Reviews
| 225 Interview Questions: 1 - 10 of 225 | Sort by |
Feb 6, 2010
Interview Question for Engineer at Google:
|
“Out of my skillset, which aspect did I consider as my primary skill and they should consider a primary reason why they hire me.” |
Feb 6, 2010
Interview Question for Software Engineer at Google:
|
“Why do you want to change your job?” |
Feb 3, 2010
Interview Question for AdWords Associate at Google:
|
“What could be improved on AdWords or Analytics?” |
Feb 3, 2010
Interview Question for AdWords Associate at Google:
|
“What is Google's next million dollar ida?” |
Feb 3, 2010
Interview Question for Software Engineer at Google:
|
“You're writing an application that receives a stream of individual items of data. The stream may be very long or very short, but you have no way of knowing how long it is (i.e. there's no trick to figuring out the size of the stream of data). How would you go about choosing m items such that any subset of m items was equally likely? (Not an even distribution of values, but just that any m items are equally likely to be chosen). So for example, m=1000, and the number of items in the stream, n, may be 1000, or 10000, or 100000000, or much much larger; there is no way to know how many.” |
Feb 3, 2010
Interview Question for Software Engineer at Google:
|
“You're given a binary tree and pointers to two nodes in the tree. Describe the fastest algorithm you can come up with to determine the closest common ancestor.” |
Feb 3, 2010
Interview Question for Online Global Advertising Associate at Google:
|
“Why are manhole covers round?” |
Feb 3, 2010
Interview Question for Software Engineer Intern - Arabic Language - Zurich at Google:
|
“Given an integer, write a c++ code that would count the number of bit positions that are set (1's)? What is the time complexity of your algorithm? |
Feb 2, 2010
Interview Question for Software Engineer at Google:
|
“What is complexity to find local maximum in array.” |