Google Software Engineer Internship interview questions
Updated Jun 1, 2026
based on 819 ratings
Difficulty
Average
Experience
Very positive
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 21 - 25 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 -
Professional consisting of 2 rounds, they have many applicants that's why sometimes no one will appear on the call but they quickly reschedule. The interviewers are very friendly and assist you in solving tasks.
I applied through an employee referral. I interviewed at Google (Tel Aviv) in Dec 2024
Interview
Home assignment (was easy), two technical interviews over zoom - can be in english, after that if you pass you can be matched to a team. After the home assignment there will also be a preferences form to submit
Interview questions [1]
Question 1
A subtree is a tree with the exact same nodes as the original tree. Return true if there is a subtree in the given tree, false otherwise
The recruitment process for this position proved to be excessively lengthy and cumbersome, involving numerous stages that felt repetitive. Additionally, maintaining consistent communication with the recruiter was quite challenging, as responses were often delayed, making it difficult to stay informed about my candidacy status throughout the journey.
Interview questions [1]
Question 1
Given N numbers: a[0], a[1], ..., a[N-1]
find i <= j such that:
a[i] = a[j]
and
sum a[i] + a[i+1] + ... + a[j-1] + a[j] is maximized.