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.
1
Otras evaluaciones sobre las entrevistas para el cargo de Software Engineer SWE III en Google
Me postulé en línea. El proceso tomó 3 semanas. Acudí a una entrevista en Google (Tel Aviv)
Entrevista
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
Preguntas de entrevista [1]
Pregunta 1
Just generic behaviour questions, nothing specific
