Candidates applying for Software Engineer roles take an average of 21 days to get hired, when considering 1 user submitted interviews for this role. To compare, the hiring process at Google overall takes an average of 38 days.
Common stages of the interview process at Google as a Software Engineer according to 1 Glassdoor interviews include:
Phone interview: 33%
Skills test: 33%
One on one interview: 33%
Here are the most commonly searched roles for interview reports -
Online assessment 2 leetcode hards did not move on to next round because I didn’t solve them unfortunately
Make sure you practice your leetcode graph problems and dp hard and you should be good
It was both exhilarating and intense, beginning with a recruiter reaching out via LinkedIn after I applied through their careers portal. The process kicked off with a 45-minute phone screen where I tackled algorithmic problems on a shared coding platform, focusing on data structures like arrays and trees, which I nailed thanks to rigorous LeetCode practice. Advancing to the onsite rounds at their Mountain View campus, I endured a grueling day of five back-to-back interviews: two on coding challenges involving dynamic programming and graph traversal, one on system design where I architected a scalable messaging app akin to Google Chat, a behavioral session delving into past projects and teamwork using the STAR method, and finally, a casual chat with a potential manager about company culture and my passion for AI-driven innovations. Despite the brain-teasing puzzles and whiteboard sessions that tested my problem-solving under pressure, the interviewers were supportive and insightful, providing subtle hints when I got stuck. Ultimately, while I didn't land the offer due to stiff competition, the experience honed my skills, offered valuable feedback on optimizing code efficiency, and reinforced my admiration for Google's emphasis on innovation and work-life balance.
Interview questions [1]
Question 1
a challenging coding question where they asked me to implement Dijkstra's shortest path algorithm for finding the minimum distance from a source node to all other nodes in a weighted graph, while also explaining how to use a priority queue for optimization and analyzing its time complexity.
I applied through a recruiter. The process took 2 weeks. I interviewed at Google in Mar 2025
Interview
Recruiter was nice and cooperative, the programmer I got was literally reading the question with its story without pasting it in the code editor. After asking him to repeat parts of the story I found out it's a Djikstra algorithim. We lost half of the interview just to clarify what has to be done because the story was way too long to read it out loud. Not enough time for clear implementation
Interview questions [1]
Question 1
Find a path in a matrix starting in left top corner, ending in right bottom corner that would have the lowest maximal value on the way