Candidates applying for Software Developer 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 Developer according to 1 Glassdoor interviews include:
Phone interview: 33%
One on one interview: 33%
Skills test: 33%
Here are the most commonly searched roles for interview reports -
I applied online. I interviewed at Google (Sydney)
Interview
Applied for a mid-level software engineer role at Google and got a reply from a recruiter after about two weeks. The process took roughly five weeks in total. First round was a recruiter screen standard stuff, nothing surprising. Then came a technical phone screen over Google Meet with a shared Doc; the question was graph-based, I got to a working solution but felt pretty rushed and got almost no feedback. After that, they scheduled a virtual onsite with four back-to-back interviews: two technical rounds (dynamic programming and binary trees), a system design (designing a rate limiter), and one behavioral round. I did fine in one coding round, struggled a bit in the other, and felt like I gave okay but not amazing answers in system design. The behavioral one felt vague — lots of “tell me a time when” questions, and I wasn’t sure what they were really looking for. About a week later, I got a templated rejection email with no real feedback, which was honestly a bit frustrating given how much time I’d put into prep. Tried asking the recruiter for insights, but got the usual “you can reapply in 6 months” response. Overall, a fair process but cold
Data Structures & Algorithms
Arrays/Strings:
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
Graphs:
Given a list of airline tickets represented by pairs of departure and arrival airports, reconstruct the itinerary in lexical order.
Dynamic Programming:
You are climbing a staircase. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Trees:
Given a binary tree, return the level order traversal of its nodes’ values (i.e., from left to right, level by level).
Interview questions [1]
Question 1
Data Structures & Algorithms
Arrays/Strings:
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
Graphs:
Given a list of airline tickets represented by pairs of departure and arrival airports, reconstruct the itinerary in lexical order.
Dynamic Programming:
You are climbing a staircase. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Trees:
Given a binary tree, return the level order traversal of its nodes’ values (i.e., from left to right, level by level).
One online assessment + back to back coding interviews + team match! Overall straightforward and clear. If you don’t do well in one of the interviews, third one will be scheduled