I applied through an employee referral. The process took 4 weeks. I interviewed at Google (London, England) in Feb 2013
Interview
I was contacted by a recruiting contact from HR. From there I was passed off to another contact who scheduled two back to back, 45 minute coding interviews. The first interviewer was very pleasant. After initially asking a question on which I fumbled, we spent the remaining time working on one question. The question itself wasn't terribly difficult, but it was intentionally ambiguous, to make sure I asked the right questions. After clearing up details we discussed optimizations, etc. This is probably the part of the interview that was most enjoyable as it didn't really feel like I was getting grilled. It felt as if we were discussing a problem and different approaches we could take. The second interviewer had a bit of an accent and seemed a bit less engaged/helpful. Also, the questions he asked were significantly tougher. All in all the process went very smoothly.
Interview questions [1]
Question 1
I was asked to write an algorithm to solve a crossword-like puzzle (I forget the name, but started with a 'B'). As opposed to simply vertical, horizontal, and diagonal placement of words, they were allowed to snake around the grid in any way. I immediately thought "recursion" since you have to check every adjacent grid space to make a possible word. Needless to say, I didn't completely finish coding, but I did have the thought process correct.
I applied through a recruiter. I interviewed at Google (Bucharest, Bucuresti) in Feb 2026
Interview
I had just the first round and we talked about my experience and the tools that I used and also what other programming languages I was familiar with. And about the schedule
I applied online. The process took 4 months. I interviewed at Google in Sep 2024
Interview
Quattro colloqui tech con foglio condiviso incentrati su codice e algoritmi e un colloquio googleyness su project management e attitudine personale.
Difficoltà media per i colloqui tech. Googleyness abbastanza semplice