Meta Software Engineer - Internship interview questions
based on 718 ratings - Updated May 13, 2026
Averageinterview difficulty
Very positiveinterview experience
How others got an interview
33%
Applied online
Applied online
31%
Employee Referral
Employee Referral
22%
Campus Recruiting
Campus Recruiting
13%
Recruiter
Recruiter
0%
Other
Other
0%
In Person
In Person
Interview search
718 interviews
Viewing 141 - 145 of 718 Interviews
Meta interviews FAQs
Software Engineer - Internship applicants have rated the interview process at Meta with 3.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 74.2% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Engineer - Internship roles take an average of 14 days to get hired, when considering 3 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 43 days.
Common stages of the interview process at Meta as a Software Engineer - Internship according to 3 Glassdoor interviews include:
Phone interview: 67%
Presentation: 33%
Here are the most commonly searched roles for interview reports -
I applied through an employee referral. I interviewed at Meta
Interview
2 Phone screens, recruiter call;
Both phone screens were two leetcode easy/mediums. then recruiter chat. Interviewers were generally nice, but did not seem to enjoy their time. How is this not 30 words.
two questions ,one is easy and familiar the other is more difficult you have 45 minutes to solve the two questions
the difficult one a this graph question it sounded similar to the lowest comm0n ancestor in a tree problem but I wasn't familiar with this question during the interview, also the graph given in an array was confusing to me especially the direction of the edges for each tuple
Interview questions [1]
Question 1
given a Directed Acyclic Graph and two vertices find if the two vertices have a common ancestor
example:
[(1,2),(3,4),(1,3),(5,4)]
2 & 4 have 1 as common ancestor so it returns true
3 & 5 don't have common ancestor so should be returned false
A recruiter contacted me through Linkedin, then I sent my resume. I did 2 technical interviews (competitive programming problems). After waiting a bit I got an offer. That is all but i need to complete the 30 word mnimum lol
Interview questions [1]
Question 1
competitive programming BFS/DFS problem - logarithmic search and hashing problem