Ho presentato la mia candidatura online. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Google nel mese di mag 2017
Colloquio
Two phone interviews which required me to code on a Google Doc. Overall the experience was very fun, with good technical questions to choose from. However, my first interviewer was 20 minutes late to the phone call and really disrupted the interview process (had some awkward explaining to do to my next interviewer who called during my first interview). I told my recruiter about it, but the delay threw everyone off a little bit, myself included. Personally, I don't believe this happens too often with Google interviews, I just happened to get less fortunate experience this time around.
Domande di colloquio [1]
Domanda 1
Given an array of sorted numbers, create a balanced BST.
Home exam, 2 questions in 90 mins
Then they did 2 interviews-45 mins each
It was on google meet
The interviews are in English, the first question was matrix dfs and the second one was hashmap with random function
Ho sostenuto un colloquio presso Google (Tel Aviv)
Colloquio
There were multiple stages to the process, but the main one of which was technical interviews through digital meetings (Zoom) consisted of 2 meetings, in which you have to solve 1 leet-code style question, levels medium-hard.
Ho presentato la mia candidatura tramite segnalazione di un dipendente. Ho sostenuto un colloquio presso Google (Tel Aviv)
Colloquio
My application process started in November with two LeetCode-style home assignments. In December, I sat for two technical interviews on Google Meet. Although they were meant to be back-to-back, one was rescheduled after the interviewer didn't show up. I successfully navigated a medium question with a follow-up and a hard DFS/graph problem.
Two weeks later, in January, I moved into the host-matching phase. After one team match interview in February, I wasn't selected, and by April, I received a final update that the process was closing because no further team matches were found.