Google Interview Experiences

103 results

• 

  Two Case-Study Rounds, No Coding, Rejected After 3 DaysGoogle · Data Scientist · Technical Screen · Oct 2025

  Rejected

  Round 1: Measurement & Modeling Concepts A case study: Google Meet has a big customer who complains that meetings keep dropping/disconnecting. They ask how you'd analyze and solve this problem, how you'd put together an analysis plan, and how you'd estimate the impact. If it's affecting retention, how do you build a model to predict retention (contract renewal)? How do you evaluate models, what a…

• 

  Coding, Networking, and a Distributed Rate LimiterGoogle · Site Reliability Engineer · Onsite · Sep 2025

  I interviewed for a Google SRE position a few days ago. The overall difficulty wasn't especially algorithm-heavy — it leaned more toward system design, real-world troubleshooting, and coding. Interview content Coding (LeetCode style) They asked a string-processing question: given a log file where each line is "timestamp, user, action," count the number of sessions per user. It was a variant of "g…

• 

  Cracking the 111-Statement Personality ScreenGoogle · Software Engineer · HR Screen · Sep 2025

  Google has recently started requiring candidates to fill out a kind of psychometric test that checks their tendencies and behaviors in a work environment — things like communication style, collaboration, and problem-solving ability. This helps them judge whether a candidate has the knowledge, skills, and abilities needed to succeed at the company. Because of the sheer volume of applications they…

• 

  Cutting Squares of Cake with Binary SearchGoogle · Software Engineer · Onsite · Sep 2025

  One of my interview questions: There's a table, and the top-left corner of the table is the origin (0, 0). On the table there are countless non-overlapping square cakes of different sizes. The question: how do you make one horizontal cut (parallel to the x-axis) so that after the cut, the total cake area on each side is equal? The interesting part is that all the coordinates are floats, but the s…

• 

  Four Onsite Rounds from HashMap to OODGoogle · Software Engineer · Onsite · Sep 2025

  Here's my interview experience: Round 1: A medium-difficulty string + hashmap question. I found the approach pretty much right away and had no trouble talking it through before I started coding. At the end there was a follow-up on how to make the code more production-ready. Round 2: An easy heap question. I basically figured out to use a heap and that solved it. The interviewer was pretty nice, a…

• 

  Straight to Onsite, Rejected After One Weak ReviewGoogle · Software Engineer · New Grad · Onsite · Sep 2025

  Rejected

  Referred by a friend on 4/7 for an early career role. Got an "aha" notification on 4/20, HR reached out on 5/1, and had the HR call on 5/13. No OA, no phone screen — straight to onsite. 3 coding rounds + 1 BQ round. I got lucky — all 3 coding interviewers turned out great. Round 1 was a trie problem. The problem statement wasn't very clear, and I got nervous while coding, so I forgot to store res…

• 

  Two OA Questions, No Hidden Test CasesGoogle · Software Engineer · Online Assessment · Sep 2025

  In progress

  I finally got my Google OA, and I'm posting here right after finishing it. This OA had 2 questions total, 90 minutes, which keeps Google's usual style. Both questions were not too difficult overall. Problem 1 (paraphrased) You have a one-dimensional board, and each cell can be in one of three states: empty, a piece, or a coin. On each turn, you can choose any piece and move it 3 cells to the righ…

• 

  Four Technical Rounds, From a Mumbled Zigzag Traversal to a Log-Eviction DesignGoogle · Software Engineer · Technical Screen · Aug 2025

  Round 1: Technical Interview The interviewer was a guy with a really heavy accent, spoke fast, and I had a hard time understanding him. For the whole round I was basically guessing what he was asking. This round was a binary tree traversal question (a LeetCode original or a close variant). The core ask: given the root of a binary tree, implement a zigzag (sawtooth) level-order traversal. This is…

• 

  Interviewer Told Me Mid-Round I'd Failed the Parentheses DP ProblemGoogle · Software Engineer · Onsite · Aug 2025

  Rejected

  Round 1: The input is a string made up of parentheses and numbers, something like "(( ))2 )1( )". Index: 0 1 2 3 4 5 6 7 8 Element: ( ( ) ) 2 ) 1 ( ) Say the index of a number is i — for example the number 2 is at index 4, and the number 1 is at index 6. For a given number, you have to pick: Exactly that many parentheses to remove. For the number 2, you pick two parentheses from before it and rem…

• 

  Interviewer's Test Cases Contradicted Each OtherGoogle · Site Reliability Engineer · Technical Screen · Jul 2025

  In progress

  I had a phone interview today for a Google SRE position — a DSA round. It was a question I'd already done before (an original LeetCode problem), but I'm guessing the interviewer is still going to fail me. Everyone should learn this technique for failing candidates: give a ton of test cases — looked like 8 of them. At first, since it was the original problem, I started explaining to him how to sol…

• 

  Passing the 60-Question Behavioral Online AssessmentGoogle · Software Engineer · Online Assessment · Jul 2025

  I did it the day before, and the next day I was told I passed. This one, maybe everybody passes. There were about 60 questions total. I can't say the specific questions, so I'll just give you the gist. The types were all about behavior — things like ethics, cooperation, work attitude, and so on. There were five levels total, from Strongly Disagree to Strongly Agree. It says it takes about 30 minu…

• 

  Two Rounds, Rejected Three Weeks LaterGoogle · Data Scientist · Onsite · Feb 2025

  Rejected

  I got pulled back in and then had two rounds. Interviewed in early January. The first round was coding. Three questions — I don't fully remember all the details. One was something like: you're given a random generator that can produce a uniform sample in (0,1), and you need to write a function that returns a 2-D uniform sample in the square (-1,1) x (-1,1). Treat the random generator as a functio…

• 

  A Streak-Counting Problem, Then Straight Into BehavioralGoogle · Data Scientist · Technical Screen · Jan 2025

  The technical interview was with an interviewer who showed up a little late. After introducing themselves, they went straight into coding. Count the number of segments in an event sequence that satisfy the "super streak" condition. The conditions: the number of consecutive events of the same type must be >= N, the gap between adjacent events must be = X. Walk…