Google 26ng two rounds of VO real review|Google interviewer is too good at "digging"!

418 Views
No Comment

I just finished taking a student to get Google 26ng VO double rounds all through, this interview can be said to be the "basic + expression" test to the extreme.
There are no fancy questions, all "real work" investigation. We were assisted by voice throughout the day, and it was the first time that we had a close-up experience of the kind of "gentle and sharp" questioning style of Google interviewers.

Google 26ng

Round 1 - Coding

The interviewer was particularly chill and started the question directly after exchanging a few pleasantries.
The first question turned out to be a classic high-frequency question:

Topic 1: Subarray Sum Equals K

Given an array of integers, find the number of consecutive subarrays that sum to K.

The question is not about algorithms, but about how well you can "dismantle the optimization" from the violent ideas.

The trainee just started to say violent solution O(n²) directly, the interviewer smiled and nodded, then asked:

"So what would you think if I asked you to optimize to O(n)?"

This is when our voice assist system prompts:
"Talk about the prefix sum + hashmap idea, don't rush it."
So the trainee blurted out obediently:

"I'll use a hash table to keep track of the number of times the prefix sum occurs, and traverse to see if prefixSum - K occurs, so that I can tell how many segments in the middle of the subarray have a sum of K."

Then step-by-step, write as you go along, with a special addition to initialize the {0:1} details (dealing with cases that are satisfied from the beginning).
The interviewer said on the spot, "Good, that's the reasoning I'm looking for."
The code is actually not complicated, but the key is the way the logic is interpreted.

Then came the second question:

Topic 2: Convert BST to Sorted Circular Doubly Linked List

Converting a binary search tree into a sorted circular bidirectional linked list.

This question is really a pointer manipulation question, but Google likes to see if you can sort out the flow of state in recursion.

As soon as the trainee started talking about the middle-order traversal idea, we prompted him in real time to make the "prev pointer update" and "first and last loop" parts clearer.
So he immediately added:

"I maintain a global prev pointer on recursion, so that each node has a left pointing to the previous one, a right pointing to the next one, and then finally the first and last are connected to form a ring."

The interviewer followed his drawing to confirm the logic, and ended up asking a couple boundary questions (empty tree, single node case), all of which were answered solidly.

The round overall 45 minutes, the participants clear thinking, natural rhythm, and finally the interviewer also complimented:

"I like how you communicate while coding."
In a Google interview, this statement is basically a perfect rating.

Second round - Behavioral

The second round was pure BQ without a single line of code.
This round of interviewer style especially "psychologist", ask all the details follow-up.

A few high-frequency questions include:

  • "Tell me about a project you're most proud of."
  • "How do you handle negative feedback?"
  • "Describe a time when you had a conflict with a teammate."
  • "When have you gone beyond your responsibilities?"

Instead of going through the process, each issue is a deep dive.
For example, the trainee talked about a project to make a recommender system, and the interviewer followed up with a direct question:

"Why did you choose that evaluation metric?"
"If your teammate disagreed, how would you convince them?"

The Assist System is primarily responsible for voice cadence reminders in this round-
When participants go into too much detail, we prompt "Go to Action";
When pressed by the interviewer, prompt for a "Complementary Result Summary".
Throughout the round the STAR framework logic was clear and the story hierarchy was complete.

Google's Behavioral Side is actually harder to prepare for than Coding, it's about the way you think and your ability to reflect.
As long as you can show the interviewer "how you solve problems", they will think you are fit.

Interviewer Impression & Overall Pace

Google interviewers are really professional.
The whole process was gentle, but the questions were always "stuck on point".
You won't be interrupted, but every follow-up will instantly reveal the blind spots in your thinking.

That's why we recommend that participants always prepare with a **"real-time voice simulation "**.
You need to learn to think, organize your logic, and maintain a steady pace of speech all at the same time as you explain.
These are things you can't train on purely by brushing up.

Programhelp Take you to the Dream Offer

Many people think that Google interviews rely on IQ, but in fact, they rely more on the ability to present ideas + communication skills.
We mentor hundreds of students every year to get into FAANG, and we know the mechanics of the company better than anyone.

If you are also preparing for Google / Meta / Amazon VO and want to experience "voice assistance + thought guidance" in real interview scenarios, you can find Programhelp's professional team of seniors, we will customize the question prediction and simulation training program for you based on the job and past interview data.

Don't tough it out on your own with the last wave of opportunities for fall recruiting season. Prepare right and an interview can really make or break the entire fall.

author avatar
Jory Wang Amazon資深軟體開發工程師
Amazon 資深工程師,專注 基礎設施核心系統研發,在系統可擴充套件性、可靠性及成本最佳化方面具備豐富實戰經驗。 目前聚焦 FAANG SDE 面試輔導,一年內助力 30+ 位候選人成功斬獲 L5 / L6 Offer。
END
 1