J'ai postulé via une autre source. Le processus a pris 6 mois. J'ai passé un entretien chez Google (San Francisco, CA) en juin 2022
Entretien
A recruiter reached out to me via LinkedIn and we set up a phone screening. The phone screening went very well and the recruiter was very friendly. They moved me directly to the final round which consisted of 3 technical and 1 behavioral interviews. The technical questions were three leetcode medium questions. The first one was a recursive problem and the other two were graph traversal problems. I think I did okay on the interviews but they decided to proceed with matching me with a team. I had one team matching interview but we weren't a fit for each other. After the team matching interview, my recruiter stopped responding to my emails and I haven't received a final decision.
Questions d'entretien [1]
Question 1
1. recursive 2. breath first search 3. breath first search 4. behavioral questions
J'ai postulé en ligne. Le processus a pris 3 semaines. J'ai passé un entretien chez Google (Tel Aviv-Yafo)
Entretien
Not my first time interviewing there so immediately got to on-sites. had 4 interview 2 coding interview, system design and goodlyness.
All of them went good/not bad, nice interviewers ... all in english with interviewers from around the world.
Too hard to pass, spent a lot of time preparing but didn't get to the stage of questions where leetcode would be useful. Not recommended to apply and waste time
Questions d'entretien [1]
Question 1
Just generic behaviour questions, nothing specific
J'ai passé un entretien chez Google (California, MD)
Entretien
Round 1 (Phone Screen):
Given an array of integers, find the length of the longest subarray with sum equal to 0. (Used prefix sum + hashmap approach.)
Round 2 (Technical Interview):
Given a binary tree, return the diameter of the tree (longest path between any two nodes). (DFS recursion based solution.)
Round 3 (Technical Interview):
Design a data structure that supports insert, delete, and getRandom in O(1) time. (Implemented using HashMap + Array. Follow-up: handle duplicates.)
Round 4 (Final Technical + Behavioral):
Behavioral questions on teamwork and problem-solving.
Coding: Word Ladder problem – Given two words, return the shortest transformation sequence length using BFS.
Round 5 (Managerial Round):
Scenario-based questions on handling conflicts, prioritizing tasks under deadlines, and managing dependencies across teams.
Round 6 (Hiring Manager / HR):
Behavioral round covering career aspirations, why Google, strengths/weaknesses, and cultural fit questions.