Google Software Engineer Internship interview questions
based on 822 ratings - Updated Jun 26, 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
822 interviews
Viewing 316 - 320 of 822 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 4 weeks. I interviewed at Google in Jan 2021
Interview
I took an online assessment and then was contacted for an interview. My first interview was a leetcode question that I struggled through. I think at this point people either get a rejection or an offer, but I was contacted for a second interview. Which I bombed and got no offer.
I applied online. I interviewed at Google in Jan 2021
Interview
There were 2 tasks with 2 different interviewees in Google Meet. They had on purpose to check your algorithms knowledge, logical and agile thinking, and of course solid knowledge of at least one coding language you are free to yse (I chose Python).
Interview questions [1]
Question 1
Interview questions are non-disclosable, but analogues can be easily found in the web.
3 coding interviews followed by informal conversations with different teams. The coding interviews were similar to those in programming competitions, with an emphasis on explaining your thought process well, not just writing code.
Interview questions [1]
Question 1
You have an array a and you can ask the sum of a[n...m] or update position a[i]. Create a datastructure that does both efficiently.