Facebook Phone Round 1 - Seattle - Rejected
Anonymous User
2314

Hello everyone,

I was contacted by a Facebook Recruiter via Linkedin and they scheduled a phone round with me.
The call was for 45 minutes, in which first 5 minute the interviewer will introduce themselves and then they will ask a short 5 minute introduction of yourself. So you get 35 minutes to understand the question, make a plan and write code for it.

I was asked to "find lowest common ancestor in directed acyclic graph" coding question which I found extremely tough to do in 35 minutes.

https://stackoverflow.com/questions/14865081/algorithm-to-find-lowest-common-ancestor-in-directed-acyclic-graph

I think if you don't know the exact algorithm, it is very tough to solve this problem, I tried my best but couldn't complete the code in given time and got rejected.

I had solved around 200 questions on leetcode.

Comments (5)