Interview questions asked by Google Recruitment team after qualifying the first on-campus round comprising a written exam:Round 1:1) Given a database, a query returns correct output 99% of the time, however 1% of the time, it returns wrong output. What could be the possible reasons?2) On a 2-D grid, the positions (x,y) of 3 persons are given. ...
[More]
A friend of mine is interviewing for a job. One of the interview questions got me thinking, just wanted some feedback.
There are 2 non-negative integers: i and j. Given the following equation, find an (optimal) solution to iterate over i and j in such a way that the output is sorted.
2^i * 5^j
So the first few rounds would look like this:
2^0 * 5^...
[More]
Posted by
Admin on
5/9/2012 5:01 PM |
Comments (0)
We've moved to http://intearview.com/! So please update your rss subscriptions (those who subscribed through feedburner - the url remains the same http://feeds.feedburner.com/GoogleInterview).
Thanks and see you again,
Intearview Team
Background: I'm a hiring manager for sysadmins, tech support people, and the occasional front-line manager thereof, and have worked in and interviewed for those positions most of my career, except for a brief stint driving trains -- of which the interview phase was surprisingly valuable in giving me an alternate view of how interviewing...
[More]
Tags: algorithm |
Posted by
Admin on
3/13/2012 11:11 AM |
Comments (7)
There is a matrix, m x n. Several groups of people locate at some certain spots. In the following example, there are three groups and the number 4 indicates there are four people in this group. Now we want to find a meeting point in the matrix so that the cost of all groups moving to that point is the minimum. As for how to compute the cost of movi...
[More]
Tags: math |
Posted by
Admin on
3/7/2012 12:44 PM |
Comments (6)
For starters, don't just automatically act all "Game Over, man!" when you hit a dead end! Also, it helps to try to keep talking as you come up with an answer, because silence is very uncomfortable for both you and the interviewer!
There are companies that deal with numbers that will ask you some math questions. These are the kind o...
[More]
There were 3 rounds of interview.In the first round they asked s string related question.1. Given a string and set of characters, find the shortest substring which contains all the characters in the string.In the 2nd round2.Given a 2d sorted matrix (known as tableau) . where rows and cols are sorted, write an algo to find an element.In the 3rd roun...
[More]
Tags: algorithm |
Posted by
Admin on
2/23/2012 10:35 AM |
Comments (9)
Given 2n points on a circle.find the number of ways to draw n non intersecting chords.
You have 1 to N-1 array and 1 to N numbers, and one number is missing, you need to find the missing the number. Now you have 1 to N-2 numbers, and two numbers missing. Find them.
Solution:The question can be elucidated as follows.Given an array of size N-1 containing numbers less than N and with out any duplicates!! We knew that there is a n...
[More]
Interviewing at Google bucked Wes Bos' pre-conceived notions of what an ideal candidate is.
The web developer thought Google wanted someone with a degree in computer science and only hires guys who can program in many languages.
But to his surprise, Google showed interest in him. On his blog, Bos wrote about what it was like to go th...
[More]
Many individuals dream of working in Google, experiencing the helpful and also wide open functioning habitat and also a number of large benefits. As a reason of this, folks had written many stories about several tangible Google interview questions and google choosing process. A few of the reports may be genuine, while many different tend to ...
[More]
Given an undirected graph, design a O(V+E) algo to detect whether there is a triangle in the graph ot not.
Question: How to find the Least Common Ancestor for 2 nodes of a binary tree?
This sounds like "On finding lowest common ancestors: simplification and parallelization", by Baruch Schieber and Uzi Vishkin, SIAM J. Comput. Vol 17, No 6, December 1988. A google search leads me tohttp://ia700208.us.archive.org/12/items/onfindinglowe00schi/onfindin...
[More]
Jim was asked following question in interview recently:
Let suppose you have, following grid on Cartesian coordinate system ( Quadrant I).
o - x - x - x - o
| | | | |
x - x - x - o - x
| | | | |
x - o - o - x - x
where, o => person at intersection and x => no person at intersection
class Point {
int x;
int y;
boolean h...
[More]
Given a sorting order string, sort the input string based on the given sorting order string.
Ex sorting order string -> dfbcae
Input string -> abcdeeabc
output -> dbbccaaee