I applied online. The process took 3 days. I interviewed at Google (Londres, Angleterre) in Jan 2019
Interview
First an online multiple-choice test that contained questions from microprocessors, programming, etc. and basic math problems.
Then if shortlisted, two rounds of technical interviews.
Then HR interview if passed both rounds.
Very easy questions from OOPs concepts, DBMS etc. like what are the basic pillars of OOPs? They asked mostly about the projects mentioned in resume in the first round, and little bit in second one. What concepts you implemented etc.? And they asked some data structures and algorithms questions in both too. And some puzzle type questions.
Interview questions [1]
Question 1
Very easy questions from OOPs concepts, DBMS etc. like what are the basic pillars of OOPs? They asked mostly about the projects mentioned in resume in the first round, and little bit in second one. What concepts you implemented etc.? And they asked some data structures and algorithms questions in both too. And some puzzle type questions.
I applied through a recruiter. The process took 4 weeks. I interviewed at Google (Somerville, MA)
Interview
I had two phone interviews. My understanding is that there is usually only one, and then an in-person interview for the second round. I believe they wanted a second phone interview because the first interview was strangely easy. (I won’t share the question, but it involved simple string lengths, and I could have answered it directly out of my software bootcamp.) The second interview pertained to data structures, and was certainly more challenging. I was prepared for it. However, the interviewer seemed to articulate a different problem than what was copy-pasted from the bank of questions. I won’t share specifics, but he gave me a hypothetical data structure, wouldn’t tell me what specific kind of data structure, said that it was “broken” (nonstandard speak for this kind of structure) and that I had to fix it. I asked questions about duplicate entries, and whether I could, for example, assume it was a BST or a minHeap. He said no, and that it could be any random type of this kind of structure. Then he asked me how I would represent the data structure, at which point I became even more confused. (If I’m given a hypothetical chunk of date, I can assume it’s already represented in *some* way, such as an array, a linked list, etc... So, what exactly was I given?)
After the fact, I attempted to ask for the wording of the original question but was unsuccessful. It’s entirely possible the interviewer was new to interviewing, or that translation issues resulted in poor communication between us. Overall, it was an awful lot of preparation to be undone by poor articulation of the problem.
Aside from the unfortunate circumstances over the phone, the interviewer (and everyone else) was very nice to work with.
is fine. not very long. Ask some java oop, algorithm. For example, inheritance, polymorphsim, abstraction , interface. what is different between interface and abstract class? what is final, finally, finalize.