Google Software Engineer candidates report an online assessment or recruiter screen, then coding-heavy interviews built around graphs, trees and dynamic programming, plus a Googleyness behavioral round.
$198K
Avg. Base Comp
$299K
Avg. Total Comp
3-5 rounds
Typical Rounds
4-10 weeks
Process Length
Candidates describing the Google Software Engineer interview mostly describe a coding-first process. Several mention an online assessment or recruiter call before live rounds, and the technical interviews lean on data structures and algorithms. Graphs and trees come up repeatedly: reports mention BFS and DFS, topological sort, Dijkstra, lowest common ancestor and a currency-conversion graph. One recent L4 frontend candidate said the interviewers wrote their own problems rather than using LeetCode questions, and most of them were graph problems.
Dynamic programming, backtracking, tries, linked lists, heaps and stack problems also appear, usually at medium difficulty, with follow-ups that raise the bar. Several candidates say they were expected to give a straightforward solution first and then optimize it. A few rounds began with vague prompts, so asking clarifying questions and defining inputs and outputs before coding mattered. Candidates also mention explaining their reasoning aloud, including while typing in a shared document.
Coding is not the whole loop. Some candidates report a behavioral or Googleyness round on motivation, teamwork and leadership. Others describe a system design prompt, such as tracking tickets at scale or a restaurant customer system, and a deep dive into a past project. Round counts differ by report, from three to five, so confirm the format with your recruiter.
Most candidates in these accounts did not receive an offer, and they call the difficulty moderate to hard, so timed practice and clear communication are worth as much as pattern knowledge.
Synthesized from 516 candidate reports by our editorial team.
Had an interview recently?
Share your experience. Unlock the full guide.
Real interview reports from people who went through the Google process.
Going in, I'd heard the usual advice to grind LeetCode, but the problems I got didn't come from there. Google wrote their own questions for my interview, and most of them were graph problems that didn't look like anything I'd practiced. The difficulty was high. I'd call the interview tough, though the interviewer was nice, which helped me stay focused. What I took from it is that memorizing standard patterns won't carry you far here. You need to be comfortable adapting graph ideas to setups you haven't seen before. I didn't get an offer. I don't have a round-by-round breakdown to share, so treat this as a picture of the problem style rather than a full map of the process.
Prep tip from this candidate
Google's interviewers wrote their own problems instead of pulling from LeetCode, and graph problems came up often, so practice modeling and traversing graphs in unfamiliar setups rather than memorizing standard solutions.
Share your own interview experience to unlock all reports, or subscribe for full access.
Sourced from candidate reports and verified by our team.
Topics based on recent interview experiences.
Featured question at Google
Select the 2nd highest salary in the engineering department
| Question | |
|---|---|
| Empty Neighborhoods | |
| Top Three Salaries | |
| Merge Sorted Lists | |
| String Shift | |
| Top 3 Users | |
| Raining in Seattle | |
| First Touch Attribution | |
| Job Recommendation | |
| Minimum Change | |
| Find the First Non-Repeating Character in a String | |
| Daily Retention Summary | |
| Find the Index with Equal Left and Right Sum | |
| Find Bigrams | |
| Delivery Estimate Model | |
| Detecting ECG Tachycardia Runs | |
| Last Transaction | |
| Size of Joins | |
| Friendship Timeline | |
| The Brackets Problem | |
| P-value to a Layman | |
| Level Of Rain Water In 2D Terrain | |
| Google Maps Improvement | |
| N-gram Dictionary | |
| Third Purchase | |
| Four Person Elevator | |
| Nearest Common Ancestor | |
| Basic Regex | |
| Type-ahead Search | |
| Cyclic Detection |
Synthesized from candidate reports. Individual experiences may vary.
Candidates report different openings. Several describe an online assessment with coding problems, one mentions two LeetCode-medium questions, and others describe a recruiter call covering background, logistics and the team. The order and format appear to vary, so confirm with your recruiter what comes first.
Some candidates describe a first live interview with one or two coding problems. One reports a simple interval warm-up and another a vague prompt that needed clarifying before coding. Others mention a split behavioral and technical round. Expect to explain your thinking aloud and start with a simple solution before optimizing.
Candidates report that the heaviest part is the algorithm rounds. Topics named include BFS and DFS, topological sort, Dijkstra, LRU cache, tries, dynamic programming, backtracking and stack problems. Medium questions with harder follow-ups are common in these accounts, and one L4 frontend candidate said the problems were custom-written and graph-focused.
Some candidates report a system design prompt, such as tracking tickets at scale or a restaurant customer management system. Others describe a round that probed a past project in detail. Treat this as something that may appear, and prepare a concise account of your own work and design tradeoffs.
Candidates describe behavioral questions about teamwork, tight deadlines, difficult coworkers, motivation for joining Google and leadership. Some mention a team-match or hiring manager conversation near the end. Prepare short, specific examples, since candidates say communication counted alongside technical performance.
