Ho presentato la mia candidatura online. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Google (Waterloo, ON) nel mese di apr 2022
Colloquio
Initial Screening. Got an email from the recruiter about the onscreen (No assesment). A 45 minutes round in the onscreen part and 5 minutes for Q/A. Overall it was pretty straightforward interview process.
HR reached out to me via call, and scheduled the interview. The first round was scheduled after 2 weeks. In the first round itself, there was a programming round of 45 minutes
Domande di colloquio [1]
Domanda 1
Implement smart malloc and smart free function in C. These functions must return a pointer which is memory aligned
Ho presentato la mia candidatura tramite un selezionatore. Ho sostenuto un colloquio presso Google (Bengaluru) nel mese di mag 2025
Colloquio
Recruiter reached out in Feb, Had my screening round in March. Then 4 rounds in April-May. In June I got to know that I've passed the interviews and moved to team matching phase.
Domande di colloquio [1]
Domanda 1
Simplifying a string expression containing multiple brackets and operands such as +, - . I had to remove all the brackets and simplify the expression.
Ho presentato la mia candidatura online. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Google nel mese di apr 2024
Colloquio
Recruiter got my profile from application list. Connected me through phone, and discussed on the process. After couple of discussions we agreed upon 1 month as preparation time. Interview schedule is also shared on a date after a month (as provided by me). They will be also providing us the preparation materials, to be frank you will get a better preparation strategy from medium blogs or youtube. Process include 5 "onsite" virtual Hangouts interviews - 3 x ds/ago, 1 system design and 1 Googleyness and Leadership .
Domande di colloquio [1]
Domanda 1
Given an array stream of 1's and 0's like '101110111000010'. Also assume this in DB and we have an API called query(indexOne, indexTwo), where it gives the result that range have contains 1 or not. Give an algo to efficiently find how many one's contains in the stream.
