Google Interview Questions & Reviews in Bangalore, India Area
Overview |
| |
Salaries |
| |
Reviews |
| |
Interviews |
| |
Photos |
| |
Jobs |
| |
|
Updated Jan 2, 2012 – Interview questions and reviews posted anonymously by interview candidates.
Ratings are reflective of location and job title.
|
Difficulty Rating [?] Based on 5 ratings 
“Average” Interview
|
Interview Experience [?] Based on 5 ratings
|
Google has 313,223 connections on Glassdoor
See Who You Know
| 1–5 of 5 Google Interviews | Sort by |
Software Developer at Google
Posted Jan 2, 2012 — 2 of 2 people found this helpful
|
3.0
Average Interview
|
Overall Positive Experience
|
Interviewed and No Offer
|
Interviewed Jul 2011 in Bangalore (India) (took a day)
The interview process with Google is robust and aimed at hiring the best brains in Computer Science, though it is a bit taxing on the applicant.
I had to first go through a phone screening round. I was asked questions about basic CS stuff. Difference between Hash Tables and Binary Search Trees, why balancing a tree is important. Then 2 algorithmic questions were asked which I was supposed to code on a shared web document. The first one was to find out number of unique elements in an array. Second one, umm, I don't remember, sorry. There was also a question on designing a file sharing mechanism.
The on site interviews were on a more intense level. I had 5 one-on-one interviews each lasting close to 1 hour.
Overall, even though I didn't get through, the experience was positive as it underscored areas I needed to look into. As with all good CS companies, Google looks for robustness of code, simplicity of solutions and of course the efficiency.
Interview Questions
Write a method to pretty print a binary tree. Don't make any assumptions, i.e. the tree could be highly unbalanced.
Given a dictionary segment a piece of un-spaced text to find meaningful words. e.g "makemytrip"->make my trip
A design question (don't remember) and another question on adversarial mini-max search
3rd Round:
Write a method to find the next ancestor of a node in a Binary Search Tree.
Write a recursive function to convert Binary Code of a number into its equivalent Gray's code and the other way round.
4th round:
Given two sorted arrays, find the kth minimum element of both.
Given a set of intervals, find the interval which has the maximum number of intersections.
5th round:
This one was focused on previous projects and experience and how good I was at what I had been doing.
Other Details
I got the interview through an Employee Referral and the interview consisted of a Phone Interview and a 1:1 Interview.
More Google Software Developer Interviews
Helpful Interview?
Yes |
No
Inappropriate?
Software Engineer at Google
Posted Feb 20, 2011
|
4.0
Difficult Interview
|
Overall Positive Experience
|
Interviewed and No Offer
|
Interviewed Dec 2010 in Bangalore (India) (took 4+ weeks)
There were four rounds.
First interviewer asked two questions:
1. Given a tree and a leaf node. Now you want to make the leaf node as the root of the tree. Write the code for same.
2. Write the code to check if given graph is bipartite or not.
Interview Questions
Other Details
The interview consisted of a Phone Interview and a 1:1 Interview.
More Google Software Engineer Interviews
Helpful Interview?
Yes |
No
Inappropriate?
Director at Google
Posted Nov 15, 2010
|
3.0
Average Interview
|
Overall Positive Experience
|
Interviewed and No Offer
|
Interviewed Mar 2008 in Bangalore (India) (took a day)
The phone interview went very quickly. He was very nice and asked about my specific talents, things I enjoy doing, and projects I’d worked on–especially those I listed on my resume. He asked about the ray tracer I wrote in college, since he had an interest in that. He also asked some general questions about the stuff I do for work. Then he got into the technical question. It was an interesting problem, and I asked follow-up questions, talked out loud, wrote things down in front of me (and told him what I was writing and why). I immediately thought of the naive solution–always a good place to start. He was interested in the asymptotic complexity. I knew there were better ways of doing it, so I started thinking of optimizations to the algorithm, trying to come up with ways of caching information, reusing previously-computed values, etc. He gave me some gentle prodding, and I think I understood immediately where he was going. I answered the question fairly well, I though.
Interview Questions
Other Details
The interview consisted of a Phone Interview.
More Google Director Interviews
Helpful Interview?
Yes |
No
Inappropriate?
Software Engineer at Google
Posted Jun 17, 2010
|
3.0
Average Interview
|
Overall Negative Experience
|
Received and Declined Offer
|
Interviewed Nov 2009 in Bangalore (India) (took 4 days)
The recruiter set up the phone round. I was asked only one question. About finding the number of ways to reach from point A to point B. The interviewer was from google maps team, and thus must be dealing with variants of question each day.
Another one asked me about how many days earth takes to go round the sun in one year.
Another one asked me to design an ATM for kids.
Interview Questions
Reason for Declining
They asked me to take a pay cut.
Other Details
I Applied Online and the interview consisted of a Phone Interview and a 1:1 Interview.
More Google Software Engineer Interviews
Helpful Interview?
Yes |
No
Inappropriate?
Software Engineer at Google
Posted Mar 19, 2009 — 1 of 2 people found this helpful
|
3.0
Average Interview
|
Overall Positive Experience
|
Interviewed and No Offer
|
Interviewed Feb 2008 in Bangalore (India) (took 1 week)
Getting the right date and time took a long. But the experience was worth it. Both the rounds of interviews were discussions around solving a single problem. More inclined on the thinking than absolute answers.
Interview Questions
Other Details
I got the interview through a Recruiter and the interview consisted of a Phone Interview.
More Google Software Engineer Interviews
Helpful Interview?
Yes |
No
Inappropriate?
RSS Feed for Google
Interviews
Embed
