Google Software Engineer(Internship) interview questions
based on 819 ratings - Updated Jun 1, 2026
Averageinterview difficulty
Very positiveinterview experience
How others got an interview
64%
Applied online
Applied online
16%
Employee Referral
Employee Referral
11%
Campus Recruiting
Campus Recruiting
8%
Recruiter
Recruiter
1%
Other
Other
Interview search
819 interviews
Viewing 606 - 610 of 819 Interviews
Google interviews FAQs
Software Engineer(Internship) applicants have rated the interview process at Google with 3 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 100% positive. To compare, the company-average is 68.7% positive. This is according to Glassdoor user ratings.
Common stages of the interview process at Google as a Software Engineer(Internship) according to 1 Glassdoor interviews include:
Phone interview: 100%
Here are the most commonly searched roles for interview reports -
I applied online. The process took 2 weeks. I interviewed at Google in Nov 2018
Interview
After applying online google contacted me to complete a few different tests and surveys. A couple weeks later they contact me again to setup a couple interviews. I ended up being interviewed by 2 different people from 2 completely different parts of google in 2 separate interviews. Each technical interview took about 30 minutes and they were strict on time. In the 2nd phone interview our connection was very bad and we could barely understand each other.
Interview questions [1]
Question 1
Q: What is the time and space complexity of the program you just developed?
Recruiter was very nice and active in reaching out to me. They gave me leeway on how I wanted to extend the interview process to prepare more for it. Did a behavioral interview, then technical assessment then technical interviews.
I applied through college or university. The process took 1 week. I interviewed at Google (Austin, TX) in Feb 2018
Interview
They asked me two questions. The first was to, given a collection of objects, filter the permutations of the objects. The second was to write a function stating whether or not an input tree was a valid binary search tree.
Interview questions [1]
Question 1
"write a function stating whether or not an input tree was a valid binary search tree"