Ho presentato la mia candidatura online. La procedura ha richiesto 2 mesi. Ho sostenuto un colloquio presso Google (Singapore) nel mese di gen 2017
Colloquio
I was contacted by a recruiter one day after submitting my resume and then scheduled a phone interview with someone based in Mountain View three weeks later.
But surprisingly, the interviewer didn't call me on the scheduled day itself. So I had to reschedule it to one week later. However, the person in charge of scheduling was on a sick leave so I had to reschedule it again.
On my third interview, very unfortunately, the (same) interviewer didn't call me once again because of some urgent family issues. So I had my fourth interview scheduled, with a Sydney-based interviewer.
This time it eventually worked out. I think the interviewer was very professional. I managed to solve two problems in 45mins but sadly, failed to be invited for the next round.
Anyway, Google is my dream company. I will reapply in a year.
String decomposition: given a string, as you go through the string, if you encounter a substring that has been seen previously, you output that substring plus the next character in the original string.
Ho presentato la mia candidatura online. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Google (Bengaluru)
Colloquio
I have filled the from linkedin job notification. Then after 20 days, I got interview call. There is direct interview call and they have sent mail to circuital branch b.tech student only.
Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 5 mesi. Ho sostenuto un colloquio presso Google (Vāranāsi) nel mese di set 2025
Colloquio
Round 1 – Data Structures & Algorithms:
Focused entirely on problem-solving and coding. The questions were of medium to hard difficulty level, testing both optimization skills and clarity of thought.
Round 2 – DSA + Googliness & Leadership:
This round included a mix of coding and behavioral evaluation. The DSA portion featured problems related to Dynamic Programming, one being similar to the Longest Increasing Subsequence type.
The last 15 minutes were dedicated to Googliness and Leadership, where I was asked situational and HR-style questions such as:
A conflict you faced and how you resolved it
Your biggest achievement or failure
How you approach challenges and teamwork
Round 3 – Technical + Behavioral mix (if applicable):
Further assessment of coding proficiency, structured thinking, and communication.
Domande di colloquio [1]
Domanda 1
The DSA portion featured problems related to Dynamic Programming, one being similar to the Longest Increasing Subsequence type.
The last 15 minutes were dedicated to Googliness and Leadership, where I was asked situational and HR-style questions such as:
A conflict you faced and how you resolved it
Your biggest achievement or failure
How you approach challenges and teamwork
Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 4 mesi. Ho sostenuto un colloquio presso Google nel mese di ago 2025
Colloquio
The interviewer was multitasking while he was interviewing me, and well he was doing it effortlessly.
He began by saying it will be a 1 hr interview, with first 45 minutes for DSA and last 15 minutes for HR questions, he then began without asking for an intro, and pasted the question to the doc.
I was able to come up with a solution within time, so I briefly explained it to him, he asked me to code it up after clarifying/understanding my approach.
After I was done, he gave another follow-up, which I gave multiple approaches to, but not the one he expected. However, he appreciated that I tried approaching in multiple ways. And he asked some common HR questions the last 15 mins, and the interview ended successfully!
Domande di colloquio [1]
Domanda 1
Given an undirected connected graph, alice and bob start from different nodes A and B and want to reach a destination node D
if they travel separate edges count them as separate, and if they meet at some node and travel the same edge together, count it as a single edge
find the minimum no of total edges travelled by alice and bob to reach D.
