Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 2 mesi. Ho sostenuto un colloquio presso Google (Anaheim, CA)
Colloquio
Took a "foo-bar" test, which coding test through the chrome browser and got an email from a recruiter to arrange the schedule of a phone interview. I could pick several available time and date then they finalize the schedule. I had phone interviews, which a two-hour coding interview by two different interviewers. Each interviewer gave me different problem and they have different style. For example, one interviewer allowed me to any of materials to solve the problem but the other didn't.
Domande di colloquio [1]
Domanda 1
A question on the data structure in programming such as HashMap. They gave me a coding problem and asked the computational complexity of the solution.
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.