La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Google (Mountain View, CA) nel mese di dic 2010
Colloquio
Due to previous interactions I had a shortened interview process. I only had to do two phone screens. The first interviewer seemed uninterested although he wasn't rude by any means. I was concerned that I wasn't engaging enough for him. He asked about my resume and pretty standard interview questions.
Second interview went a lot better. I felt like she was testing my knowledge of Google and how if I fit into the culture. She was very nice and seemed interested in actually speaking to me.
Domande di colloquio [1]
Domanda 1
Tell me about a time you had to overcome differences within a team environment.
Ho presentato la mia candidatura online. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Google (Londra, Inghilterra) nel mese di nov 2024
Colloquio
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
Domande di colloquio [1]
Domanda 1
2 coding questions leet-code easy and medium level difficulty
Ho sostenuto un colloquio presso Google (Bangalore Rural)
Colloquio
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.
Domande di colloquio [1]
Domanda 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
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Google nel mese di ago 2024
Colloquio
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.
Le migliori aziende per "stipendio e benefit" vicino a te
