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
no referral, directly applied online.
1 takehome with blue jean
2 technical rounds
- easy lc in first round
- easy-medium lc in second round
that was sufficient for intern level interview
I applied through university. I interviewed at Meta
Interview
First step in person (University recruiting), two coding problems at the blackboard and 5 minutes for questions to the interviewer.
Second step remotely. A quarter behavioural and the rest three quarters of an hour for 2 coding problems.
I felt a strong connection to the interviewers.
Interview questions [1]
Question 1
Motivations that brought me there.
Questions about SWEish experiences I had through my university career, both general (topic like particular challenges, collaboration) and more specific (experience with particular libraries).
Did the OA, the OA was 4 questions, passed, and then had an interview with a software engineer at Meta - still waiting to hear results back! I took it yesterday so fingers crossed
