recently underwent a challenging internship interview at Google, an experience that was both intellectually demanding and professionally enlightening. The technical assessments were thorough and comprehensive, requiring a deep understanding of computer science principles and creative problem-solving under pressure. Although I did not secure the internship offer, I appreciate the opportunity I had to engage with Google's high standards and learn from their expert interviewers. This experience has motivated me to further enhance my skills and embrace the growth that comes from such rigorous evaluation, making the overall journey a valuable step in my career path.
Interview questions [1]
Question 1
The interview questions during the Google internship interview covered a broad spectrum, including algorithmic problem-solving, coding exercises, data structures, system design, behavioral inquiries, puzzle/logic challenges, and whiteboard coding scenarios. These questions assessed technical proficiency, creative thinking, and problem-solving abilities. Topics ranged from algorithms and data structures to real-world coding and architectural design, alongside discussions about previous projects. The comprehensive nature of the questions aimed to evaluate candidates' capacity to apply technical knowledge effectively and thrive in Google's dynamic environment.
I applied online. The process took 3 months. I interviewed at Google in Nov 2022
Interview
Had an OA first and then two synchronous interviews with current software engineers. First interviewer was quite rude and unhelpful when I got stuck. He sighed often and just seemed overall frustrated. The question was pretty tough. Second interview was a simpler hashmap question and the interviewer was nicer. Did not get past these two interviews.
Interview questions [1]
Question 1
Robot spitting out commands and how would process them
The interviewer asked for an introduction and quickly moved to the coding question. The question was based on graphs. It was a modified version of dijks tra algo rithm. After solving this next question was given which was based on dynamic programming.