J'ai postulé via la recommandation d'un employé. Le processus a pris 1 jour. J'ai passé un entretien chez Google en avr. 2009
Entretien
I was referred by one of my friends in google in April, and one week later received a email trying to schedule a phone interview with me. You got to choose the date and time that they call you.
There were only 2 interviewers asking basic cs questions, Some other programming/algorithmatic questions were also asked.
The key is keep talking and say the easiest solution in your mind first, no matter however stupid it sounds like if it's a correct solution, then on top of that you start optimizing.
A week later I got email that i got an offer.
Questions d'entretien [2]
Question 1
if you type google.com in the browser, what will happen.
One I can't remember exactly, but involves using a linked list to do some task and with the interviewee's guidance I reached a satisfying near optimal answer.
J'ai postulé en ligne. Le processus a pris 3 semaines. J'ai passé un entretien chez Google (Londres, Angleterre) en nov. 2024
Entretien
bit confusing, but very sweet people. didn't do the coding test but got an interview so was a bit confused during the application stage. overall very nice people, very facilitating
Questions d'entretien [1]
Question 1
2 coding questions leet-code easy and medium level difficulty
J'ai passé un entretien chez Google (Bangalore Rural)
Entretien
I recently applied for the Software Engineering Summer Intern 2025 Internship at Google and successfully made it through the first technical round. During this round, I introduced myself and was given a medium-level array problem, which I managed to solve along with its follow-up question. However, I struggled to explain my thought process clearly to the interviewer. While I didn’t progress to the next rounds, the experience reinforced my determination to improve my coding skills and communication abilities for future opportunities.
Questions d'entretien [1]
Question 1
Problem Statement: You are given an array of integers which may be inverted (strictly decreasing). A peak element in an array is defined as an element that is greater than or equal to its neighbors.
Write a function to find a peak element in the array. An element
𝐴
[
𝑖
]
A[i] is considered a peak if:
𝐴
[
𝑖
]
≥
𝐴
[
𝑖
−
1
]
A[i]≥A[i−1] (if
𝑖
>
0
i>0)
𝐴
[
𝑖
]
≥
𝐴
[
𝑖
+
1
]
A[i]≥A[i+1] (if
𝑖
<
𝑛
−
1
i
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 4 semaines. J'ai passé un entretien chez Google en août 2024
Entretien
It was a great experience, it was my first interview but the interviewer was super friendly. I was asked a 2D grid related DSA problem. The interview typically lasted 45-50 minutes.